Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $\times$ 2 and 4 $\times$ 2 MIMO Systems

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 × 2) and the 4 transmit antenna, 2 receive antenna (4 × 2) MIMO systems. Presently, the best known STBC for the 2 × 2 system is the Golden code and that for the 4 × 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 × 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 × 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of M 4 for square QAM of size M. In this paper, a scheme that reduces its ML-decoding complexity to M 2¿(M) is presented.

[1]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

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

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

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

[5]  Hamid Jafarkhani,et al.  A quasi-orthogonal space-time block code , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[6]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[7]  Hamid Jafarkhani A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..

[8]  Olav Tirkkonen,et al.  Multi-Antenna Transceiver Techniques for 3G and Beyond: Hottinen/Multi-antenna , 2003 .

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

[10]  P. Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[11]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[13]  J. Belfiore,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[14]  Pranav Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2005, IEEE Transactions on Information Theory.

[15]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity , 2005, IEEE Transactions on Wireless Communications.

[16]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[17]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[18]  B. Sundar Rajan,et al.  Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras , 2006, 2006 IEEE International Symposium on Information Theory.

[19]  B. Sundar Rajan,et al.  Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.

[20]  Serdar Sezginer,et al.  Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.

[21]  Mohammad Gharavi-Alkhansari,et al.  A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[22]  Jing Liu,et al.  Trace-Orthonormal Full-Diversity Cyclotomic Space–Time Codes , 2007, IEEE Transactions on Signal Processing.

[23]  B. Sundar Rajan,et al.  Multi-group ML Decodable Collocated and Distributed Space Time Block Codes , 2007, ArXiv.

[24]  E. Viterbo,et al.  A COMPARISON OF HIGH RATE ALGEBRAIC AND NON-ORTHOGONAL STBCS , 2007 .

[25]  Mohammad Gharavi-Alkhansari,et al.  A New Full-Rate Full-Diversity Space-Time Block Code With Nonvanishing Determinants and Simplified Maximum-Likelihood Decoding , 2008, IEEE Transactions on Signal Processing.

[26]  B. Sundar Rajan,et al.  A Low-decoding-complexity, Large coding Gain, Full-rate, Full-diversity STBC for 4 X 2 MIMO System , 2008, ArXiv.

[27]  B. Sundar Rajan,et al.  A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[28]  B. Sundar Rajan,et al.  A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 × 2 MIMO System , 2009, 2009 IEEE International Conference on Communications.

[29]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[30]  John R. Barry,et al.  Fast maximum-likelihood decoding of the golden code , 2010, IEEE Transactions on Wireless Communications.

[31]  B. Sundar Rajan,et al.  Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes , 2010, IEEE Transactions on Information Theory.

[32]  A. Robert Calderbank,et al.  Fast Optimal Decoding of Multiplexed Orthogonal Designs by Conditional Optimization , 2010, IEEE Transactions on Information Theory.

[33]  A. Robert Calderbank,et al.  Fast Essentially Maximum Likelihood Decoding of the Golden Code , 2011, IEEE Transactions on Information Theory.