Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff

In the recent landmark paper of Zheng and Tse it is shown for the quasi-static, Rayleigh-fading MIMO channel with nt transmit and nr receive antennas, that there exists a fundamental tradeoff between diversity gain and multiplexing gain, referred to as the diversity-multiplexing gain (D-MG) tradeoff. This paper presents the first explicit construction of space-time (ST) codes for an arbitrary number of transmit and/or receive antennas that achieve the D-MG tradeoff. It is shown here that ST codes constructed from cyclic-division-algebras (CDA) and satisfying a certain non-vanishing determinant (NVD) property, are optimal under the D-MG tradeoff for any nt,nr. Furthermore, this optimality is achieved with minimum possible value of the delay or block-length parameter T = n t. CDA-based ST codes with NVD have previously been constructed for restricted values of nt. A unified construction of D-MG optimal CDA-based ST codes with NVD is given here, for any number nt of transmit antennas. The CDA-based constructions are also extended to provide D-MG optimal codes for all T ges nt, again for any number nt of transmit antennas. This extension thus presents rectangular D-MG optimal space-time codes that achieve the D-MG tradeoff. Taken together, the above constructions also extend the region of T for which the D-MG tradeoff is precisely known from T ges nt + nr - 1 to T ges nt

[1]  Genyuan Wang,et al.  On optimal multilayer cyclotomic space-time code designs , 2005, IEEE Transactions on Information Theory.

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

[3]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

[4]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

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

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

[7]  P. Ribenboim.  Classical Theory Of Algebraic Numbers , 2001 .

[8]  Gregory W. Wornell,et al.  Structured space-time block codes with optimal diversity-multiplexing tradeoff and minimum delay , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

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

[11]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[12]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

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

[15]  Richard D. Wesel,et al.  Universal space-time trellis codes , 2003, IEEE Trans. Inf. Theory.

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

[17]  P. Vijay Kumar,et al.  Space-Time Codes Meeting The Diversity-Multiplexing Gain Tradeo With Low Signalling Complexity , 2005 .

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