On the Decay of the Determinants of Multiuser MIMO Lattice Codes

TL;DR

This paper investigates the decay of determinants in multiuser MIMO lattice codes, providing bounds and analysis for specific code constructions, with implications for code performance and design.

Contribution

It establishes a general upper bound on the decay function and analyzes the Badr-Belfiore code in detail, deriving bounds based on algebraic number theory.

Findings

Derived a lower bound for the decay function using Liouville's theorem

Provided a tighter upper bound for the Badr-Belfiore code determinants

Listed exact bounds for finite data rates

Abstract

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.