High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space- time block codes (STBC) from cyclic division algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32 times 32 STBC from CDA, which employs 32 transmit antennas and sends 322 = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16 times 16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

[1]  Haidong Zhu,et al.  Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems , 2006, IEEE Transactions on Signal Processing.

[2]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[3]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .

[4]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[5]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[6]  Hamid Jafarkhani,et al.  Space-Time Coding - Theory and Practice , 2010 .

[7]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[8]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[9]  B. Sundar Rajan,et al.  Large MIMO Systems: A Low-Complexity Detector at High Spectral Efficiencies , 2008, 2008 IEEE International Conference on Communications.

[10]  Yi Sun A family of linear complexity likelihood ascent search detectors for CDMA multiuser detection , 2000, 2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536).

[11]  B. Sundar Rajan,et al.  A Low-complexity near-ML performance achieving algorithm for large MIMO detection , 2008, 2008 IEEE International Symposium on Information Theory.

[12]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[13]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[14]  B. Sundar Rajan,et al.  A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems , 2008, IEEE Journal on Selected Areas in Communications.

[15]  Fan Wang,et al.  An Adaptive MIMO System Based on Unified Belief Propagation Detection , 2007, 2007 IEEE International Conference on Communications.

[16]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..