Remarks on Diversity-Multiplexing Tradeoffs for Multiple-Access and Point-to-Point MIMO Channels

In this paper, we answer several open questions related to diversity-multiplexing tradeoffs (DMTs) for point-to-point and multiple-access (MAC) MIMO channels. By analyzing the DMT performance of a simple code, we show that the optimal MAC-DMT holds even when the channel remains fixed for less than Knt+nr-1 channel uses, where K is the number of users, nt is the number of transmit antennas of each user, and nr is the number of receive antennas at receiver. We also prove that the simple code is MAC-DMT optimal. A general code design criterion for constructing MAC-DMT optimal codes that is much more relaxed than the previously known design criterion is provided. Finally, by changing some design parameters, the simple code is modified for use in point-to-point MIMO channels. We show the modified code achieves the same DMT performance as the Gaussian random code.

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

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

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

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

[5]  Keith M. Chugg,et al.  Remarks on space-time codes including a new lower bound and an improved code , 2003, IEEE Trans. Inf. Theory.

[6]  Hsiao-feng Lu,et al.  Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff , 2008, IEEE Transactions on Information Theory.

[7]  Lizhong Zheng,et al.  Diversity-multiplexing tradeoff in multiple-access channels , 2004, IEEE Transactions on Information Theory.

[8]  Helmut Bölcskei,et al.  Diversity-multiplexing tradeoff in selective-fading multiple-access MIMO channels , 2008, 2008 IEEE International Symposium on Information Theory.

[9]  Camilla Hollanti,et al.  On the Densest MIMO Lattices From Cyclic Division Algebras , 2007, IEEE Transactions on Information Theory.

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

[11]  Hsiao-feng Lu.  Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing Tradeoff , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

[14]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[15]  Hofreiter.  Structure of algebras , 1941 .

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

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