Computer Science – Information Theory
Scientific paper
2009-08-18
Computer Science
Information Theory
5 pages, submitted to ITW 2010, Cairo, Egypt
Scientific paper
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 general upper bound on the decay function and study the promising code proposed by Badr and 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.
Hollanti Camilla
Lahtonen Jyrki
Lu Hsiao-feng
Vehkalahti Roope
Viterbo Emanuele
No associations
LandOfFree
On the Decay of the Determinants of Multiuser MIMO Lattice Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Decay of the Determinants of Multiuser MIMO Lattice Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Decay of the Determinants of Multiuser MIMO Lattice Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8294