Abstract
A two-stage list sphere decoding (LSD) algorithm is proposed for under-determined multiple-input multiple-output (UD-MIMO) systems that employ N transmit antennas and Msystem; while Group 2 contains layers M+1 to N that contribute to the rank deficiency of the channel Gram matrix. Tree search algorithms are used for both groups, but with different search radii. A new method is proposed to adaptively adjust the tree search radius of Group 2 based on the statistical properties of the received signals. The employment of the adaptive tree search can significantly reduce the computation complexity. We also propose a modified channel Gram matrix to combat the rank deficiency problem, and it provides better performance than the generalized Gram matrix used in the Generalized Sphere-Decoding (GSD) algorithm. Simulation results show that the proposed two-stage LSD algorithm can reduce the complexity by one to two orders of magnitude with less than 0.1 dB degradation in the Bit-Error-Rate (BER) performance. © 2013 IEEE.
Recommended Citation
C. Qian et al., "Two-stage List Sphere Decoding for Under-determined Multiple-input Multiple-output Systems," IEEE Transactions on Wireless Communications, vol. 12, no. 12, pp. 6476 - 6487, article no. 6653783, Institute of Electrical and Electronics Engineers, Dec 2013.
The definitive version is available at https://doi.org/10.1109/TWC.2013.103013.130844
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
Depth-first tree search; List sphere decoding (LSD); Turbo detection; Two-stage LSD algorithm; Under-determined multiple-input multiple-output (UD-MIMO)
International Standard Serial Number (ISSN)
1536-1276
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Dec 2013
