A Survey of Algebraic Unitary Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Differential distributed cayley space-time codes
IEEE Transactions on Wireless Communications
Recursive space-time trellis codes using differential encoding
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
Cayley space-time codes have been proposed as a solution for coding over noncoherent differential multiple-input multiple-output (MIMO) channels. Based on the Cayley transform that maps the space of Hermitian matrices to the manifold of unitary matrices, Cayley codes are particularly suitable for high data rate, since they have an easy encoding and can be decoded using a sphere-decoder algorithm. However, at high rate, the problem of evaluating if a Cayley code is fully diverse may become intractable, and previous work has focused instead on maximizing a mutual information criterion. The drawback of this approach is that it requires heavy optimization which depends on the number of antennas and rate. In this work, we study Cayley codes in the context of division algebras, an algebraic tool that allows to get fully diverse codes. We present an algebraic construction of fully diverse Cayley codes, and show that this approach naturally yields, without further optimization, codes that perform similarly or closely to previous unitary differential codes, including previous Cayley codes, and codes built from Lie groups