On the Decay of the Determinants of Multiuser MIMO Lattice Codes - Computer Science > Information TheoryReport as inadecuate




On the Decay of the Determinants of Multiuser MIMO Lattice Codes - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: In a recent work, Coronel et al. initiated the study of the relation betweenthe diversity-multiplexing tradeoff DMT performance of a multiusermultiple-input multiple-output MU-MIMO lattice code and the rate of the decayof the determinants of the code matrix as a function of the size of the signalconstellation. In this note, we state a simple general upper bound on the decayfunction and study the promising code proposed by Badr and Belfiore in closedetail. We derive a lower bound to its decay function based on a classicaltheorem due to Liouville. The resulting bound is applicable also to other codeswith constructions based on algebraic number theory. Further, we study anexample sequence of small determinants within the Badr-Belfiore code and derivea tighter upper bound to its decay function. The upper bound has certainconjectural asymptotic uncertainties, whence we also list the exact bound forseveral finite data rates.



Author: Jyrki Lahtonen, Roope Vehkalahti, Hsiao-feng Lu, Camilla Hollanti, Emanuele Viterbo

Source: https://arxiv.org/







Related documents