Treffer: New MIMO ARQ protocols and joint detection via sphere decoding

Title:
New MIMO ARQ protocols and joint detection via sphere decoding
Source:
IEEE transactions on signal processing. 54(2):473-482
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2006.
Publication Year:
2006
Physical Description:
print, 33 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Kestrel Signal Processing, Inc, Fairfield, CA 94534, United States
Department of Electrical and Computer Engineering, University of California, Davis, CA 95616, United States
ISSN:
1053-587X
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.17425342
Database:
PASCAL Archive

Weitere Informationen

In this paper, we develop some new automatic repeat request (ARQ) protocols for multiple-input multiple-out (MIMO) flat-fading channels which adapt the bit-to-symbol mapping of each ARQ retransmission. We begin by defining a model for distinctly mapped transmissions through flat-fading MIMO channels. We characterize the effect that such a mapping diversity has on an integrated receiver utilizing sphere decoding. Varying the symbol mapping complicates the sphere decoding process, particularly for the enumeration of candidate solutions within the sphere. A technique that enables quick candidate enumeration is presented, utilizing concepts from existing closest point search schemes. The advantage of mapping diversity, in reducing bit error rate and reducing computational complexity, is presented along with simulation examples.