On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
In this work, we give a bound on performance of any full-diversity lattice constellation constructed from algebraic number fields. We show that most of the already available constructions are almost optimal in the sense that any further improvement of the minimum product distance would lead to a negligible coding gain. Furthermore, we discuss constructions, minimum product distance, and bounds for full-diversity complex rotated Z[i]n-lattices for any dimension n, which avoid the need of component interleaving.