TY - GEN

T1 - On the decay of the determinants of multiuser MIMO lattice codes

AU - Lahtonen, Jyrki

AU - Vehkalahti, Roope

AU - Lu, Francis

AU - Hollanti, Camilla

AU - Viterbo, Emanuele

PY - 2010/7/27

Y1 - 2010/7/27

N2 - 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 (MUMIMO) 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.

AB - 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 (MUMIMO) 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.

UR - http://www.scopus.com/inward/record.url?scp=77954826647&partnerID=8YFLogxK

U2 - 10.1109/ITWKSPS.2010.5503178

DO - 10.1109/ITWKSPS.2010.5503178

M3 - Conference contribution

AN - SCOPUS:77954826647

SN - 9781424463725

T3 - IEEE Information Theory Workshop 2010, ITW 2010

BT - IEEE Information Theory Workshop 2010, ITW 2010

Y2 - 6 January 2010 through 8 January 2010

ER -