On the Limitations of the Naive Lattice Decoding

In this paper, the inherent drawbacks of the naive lattice decoding (NLD) for MIMO fading systems is investigated. We show that using the NLD for MIMO systems has considerable deficiencies in terms of the diversity-multiplexing tradeoff. Unlike the case of maximum-likelihood decoding, in this case, even the perfect lattice space-time codes which have the nonvanishing determinant property cannot achieve the optimal diversity-multiplexing tradeoff. Indeed, we show that in the case of NLD, when we fix the underlying lattice, all the codes based on full-rate lattices have the same diversity-multiplexing tradeoff as V-BLAST. Also, we derive a lower bound on the symbol error probability of the NLD for the fixed-rate MIMO systems (with equal numbers of receive and transmit antennas). This bound shows that asymptotically, the NLD has an unbounded loss in terms of the required SNR, compared to the maximum likelihood decoding.

[1]  Amir K. Khandani,et al.  LLL Reduction Achieves the Receive Diversity in MIMO Decoding , 2006, IEEE Transactions on Information Theory.

[2]  Hesham El Gamal,et al.  On the Optimality of Lattice Coding and Decoding in Multiple Access Channels , 2007, 2007 IEEE International Symposium on Information Theory.

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

[4]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

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

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

[7]  Amir K. Khandani,et al.  Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction , 2006, IEEE Transactions on Information Theory.

[8]  A. Edelman.  Eigenvalues and condition numbers of random matrices , 1988 .

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

[10]  Robert F. H. Fischer,et al.  Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[11]  P. Vijay Kumar,et al.  A unified construction of space-time codes with optimal rate-diversity tradeoff , 2005, IEEE Transactions on Information Theory.

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

[13]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[14]  J. Galambos,et al.  Bonferroni-type inequalities with applications , 1996 .

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