Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing Tradeoff

Constructions of multi-block space-time coding schemes that are optimal with respect to the diversity-multiplexing tradeoff when coding is applied over any number of independent fading blocks are presented in this paper. The constructions are based on the left-regular representation of elements of some cyclic division algebra. In particular, the main construction applies to the case when the quasi-static fading interval equals the number of transmit antennas, and the resultant scheme is termed minimal delay multi-block space-time coding scheme. Variations of this construction corresponding to the cases of non-minimal delay are also provided. As the number of coded blocks approaches infinity, coding schemes derived from the proposed constructions can be used to provide a reliable MIMO communication with vanishing error probability

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

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

[3]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

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

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

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

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

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

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

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

[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]  P. Vijay Kumar,et al.  Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..