On the decay of the determinants of multiuser MIMO lattice codes

Jyrki Lahtonen*, Roope Vehkalahti, Francis Lu, Camilla Hollanti, Emanuele Viterbo

*此作品的通信作者

研究成果: Conference contribution同行評審

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題IEEE Information Theory Workshop 2010, ITW 2010
DOIs
出版狀態Published - 27 7月 2010
事件IEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt
持續時間: 6 1月 20108 1月 2010

出版系列

名字IEEE Information Theory Workshop 2010, ITW 2010

Conference

ConferenceIEEE Information Theory Workshop 2010, ITW 2010
國家/地區Egypt
城市Cairo
期間6/01/108/01/10

指紋

深入研究「On the decay of the determinants of multiuser MIMO lattice codes」主題。共同形成了獨特的指紋。

引用此