On the Limitations of the Naive Lattice Decoding

DOI10.1109/TIT.2010.2059630zbMATH Open1366.94729arXiv0709.0035OpenAlexW2130581765MaRDI QIDQ5281246FDOQ5281246

Authors: Mahmoud Taherzadeh, A. K. Khandani 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/0709.0035

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Cited In (2)

• A new effective branch-and-bound algorithm to the high order MIMO detection problem
• On the universality of the LZ-based decoding algorithm

This page was built for publication: On the Limitations of the Naive Lattice Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281246)