Actas de congresos
Construction of perfect space-time codes
Fecha
2013-04-29Registro en:
Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, p. 181-188.
10.2316/P.2013.798-038
2-s2.0-84876528109
Autor
Universidade Estadual Paulista (Unesp)
Institución
Resumen
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic to the hexagonal An 2 -rotated lattice, for any channel of any dimension n such that gcd{n, 3) = 1.