A New Full-Rate Full-Diversity Space-Time Block Code With Nonvanishing Determinants and Simplified Maximum-Likelihood Decoding

A new 2times2 full-rate full-diversity linear dispersion space-time block code (STBC) is designed by augmenting the generator of the lattice of the Alamouti's orthogonal STBC and optimizing it according to the criterion of the maximal worst codeword difference determinant. The proposed STBC is proved to satisfy the nonvanishing determinant property and, therefore, to achieve the optimal diversity-multiplexing gain (DMG) tradeoff, while offering a reduced computational complexity of maximum- likelihood (ML) decoding as compared to other existing full-rate STBCs. The performance of our new code is shown to be comparable to that of the best full-rate STBCs known so far.

[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]  Georgios B. Giannakis,et al.  Full-diversity full-rate complex-field space-time coding , 2003, IEEE Trans. Signal Process..

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

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

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

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

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

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

[9]  Doron Rainish.  Diversity transform for fading channels , 1996, IEEE Trans. Commun..

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

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

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

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

[14]  Ari Hottinen,et al.  Precoder designs for high rate spacetime block codes , 2004 .

[15]  Robert W. Heath,et al.  Linear dispersion codes for MIMO systems based on frame theory , 2002, IEEE Trans. Signal Process..

[16]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[17]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

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

[19]  Ari Hottinen,et al.  Closed-loop modes for two high-rate linear space-time block codes , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

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

[21]  Krishna R. Pattipati,et al.  An improved complex sphere decoder for V-BLAST systems , 2004, IEEE Signal Processing Letters.

[22]  Arogyaswami Paulraj,et al.  Space-time block codes: a capacity perspective , 2000, IEEE Communications Letters.

[23]  Erik G. Larsson,et al.  Space-Time Block Coding for Wireless Communications , 2003 .

[24]  Nikos D. Sidiropoulos,et al.  Khatri-Rao space-time codes , 2002, IEEE Trans. Signal Process..

[25]  E. Masoud,et al.  Space-Time Block Coding for Wireless Communications , 2008 .

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

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

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

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

[30]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

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

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

[33]  K. J. Ray Liu,et al.  Full-rate full-diversity space-frequency codes with optimum coding advantage , 2005, IEEE Transactions on Information Theory.

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

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