Perfect space-time codes with minimum and non-minimum delay for any number of antennas

We here introduce explicit constructions of minimum-delay perfect space-time codes for any number n_t of transmit antennas and any number n_t of receive antennas. We also proceed to construct non-minimal delay perfect space-time codes for any n_t, n_r and any block length T ≥ n_t. Perfect space-time codes were first introduced in F. Oggier et al. (2004) for dimensions of 2 × 2, 3 × 3, 4 × 4 and 6 × 6, to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. The term perfect corresponds to the fact that the code simultaneously satisfies all the above mentioned important criteria. As a result, perfect codes have proven to have extraordinary performance. Finally, we point out that the set of criteria in F. Oggier et al. (2004) of non-vanishing determinant, full diversity, and full rate, is a subset of the more general and more strict set of criteria for optimally in the diversity-multiplexing gain (D-MG) tradeoff [Elias, P. et al., 2004], [Kumar, K.R. et al., 2005], an approach that takes special significance when constructing non-minimal delay perfect codes. Both minimum and non-minimum delay perfect codes are shown to be D-MG optimal.