An application of the Bruhat decomposition to the design of full diversity unitary space-time codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
In this correspondence, we propose new unitary space-time constellation designs with high diversity products. Our Hamiltonian and product constellations are based on Slepian's group codes, and can be used for any number of antennas and any data rate. Our Hamiltonian constellations achieve the theoretical upper bound of diversity product when the number of transmitter antennas is even and the cardinality of the signal constellation is less than or equal to 5. Many of our Hamiltonian and product constellations outperform, and have higher diversity products than, the best known designs in the literature. These include orthogonal designs, dicyclic groups, cyclic groups, parametric codes, numerical approaches, nongroup designs, Cayley codes, TAST codes and some constellations obtained from fixed-point free groups.