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]/sup n/-lattices for any dimension n, which avoid the need of component interleaving.

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.

In this correspondence, we present various families of full diversity rotated Z/sup n/-lattice constellations based on algebraic number theory constructions. We are able to give closed-form expressions of their minimum product distance using the corresponding algebraic properties.

We present new algebraic constructions of rotated cubic lattice constellations of prime dimension based on cyclic fields. The resulting constellations have full diversity and can be ranked according to the minimum product distance, a relevant performance parameter for transmission over the Rayleigh fading channel.