A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding

A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant property and offers a reduced computational complexity as compared to the other existing full-rate codes. The performance of our new STBC is shown to be comparable to that of the best full-rate STBCs known so far. This performance is achieved at the decoding complexity which is substantially lower than that of the standard sphere decoder.

[1]  B. Sundar Rajan,et al.  STBC-schemes with nonvanishing determinant for certain number of transmit antennas , 2005, IEEE Transactions on Information Theory.

[2]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

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

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

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

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[8]  Mohammad Gharavi-Alkhansari,et al.  Constellation space invariance of orthogonal space-time block codes , 2005, IEEE Transactions on Information Theory.

[9]  Elvino S. Sousa,et al.  Fading-resistant modulation using several transmitter antennas , 1997, IEEE Trans. Commun..

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

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

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

[13]  Kon Max Wong,et al.  Trace‐Orthogonal Full Diversity Cyclotomic Space‐Time Codes , 2005 .

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

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

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

[17]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[18]  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.

[19]  Norman C. Beaulieu,et al.  On two high-rate algebraic space-time codes , 2003, IEEE Trans. Inf. Theory.

[20]  B. Sundar Rajan,et al.  STBC-schemes with non-vanishing determinant for certain number of transmit antennas , 2005, ISIT.

[21]  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..