Perfect space-time codes for any number of antennas

In a recent paper, perfect (n x n) space-time codes were introduced as the class of linear dispersion space-time (ST) codes having full rate, nonvanishing determinant, a signal constellation isomorphic to either the rectangular or hexagonal lattices in 2[n.sup.2] dimensions, and uniform average transmitted energy per antenna. Consequence of these conditions include optimality of perfect codes with respect to the Zheng-Tse diversity-multiplexing gain tradeoff (DMT), as well as excellent low signal-to-noise ratio (SNR) performance. Yet perfect space-time codes have been constructed only for two, three, four, and six transmit antennas. In this paper, we construct perfect codes for all channel dimensions, present some additional attributes of this class of ST codes, and extend the notion of a perfect code to the rectangular case. Index Terms--Diversity-multiplexing tradeoff (DMT), division algebras, multiple-input multiple-output (MIMO), perfect space-time (ST) codes. Digital Object Identifier 10.1109/TIT.2007.907502