On the decay of the determinants of multiuser MIMO lattice codes

In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the determinants of the code matrix as a function of the size of the signal constellation. In this note, we state a simple but general upper bound on the decay function and study the promising code proposed by Badr & Belfiore in close detail. We derive a lower bound to its decay function based on a classical theorem due to Liouville. The resulting bound is applicable also to other codes with constructions based on algebraic number theory. Further, we study an example sequence of small determinants within the Badr-Belfiore code and derive a tighter upper bound to its decay function. The upper bound has certain conjectural asymptotic uncertainties, whence we also list the exact bound for several finite data rates.

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

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

[3]  Camilla Hollanti,et al.  An algebraic tool for obtaining conditional non-vanishing determinants , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  Mohamed Oussama Damen,et al.  A construction of a space-time code based on number theory , 2002, IEEE Trans. Inf. Theory.

[5]  T. Apostol.  Modular Functions and Dirichlet Series in Number Theory , 1976 .

[6]  M. Badr,et al.  Distributed Space-Time Block Codes for the non cooperative Multiple Access Channel , 2008, 2008 IEEE International Zurich Seminar on Communications.

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

[8]  Camilla Hollanti,et al.  Remarks on the criteria of constructing MIMO-MAC DMT optimal codes , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[9]  Helmut Bölcskei,et al.  Selective-Fading Multiple-Access MIMO Channels: Diversity-Multiplexing Tradeoff and Dominant Outage Event Regions , 2009, ArXiv.

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

[11]  Camilla Hollanti,et al.  Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels , 2009, 2009 IEEE International Symposium on Information Theory.