Construction of perfect space-time codes
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
27/05/2014
27/05/2014
29/04/2013
|
| Resumo |
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. |
| Formato |
181-188 |
| Identificador |
http://dx.doi.org/10.2316/P.2013.798-038 Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, p. 181-188. http://hdl.handle.net/11449/75186 10.2316/P.2013.798-038 2-s2.0-84876528109 |
| Idioma(s) |
eng |
| Relação |
Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013 |
| Direitos |
closedAccess |
| Palavras-Chave | #Cyclic division algebras #Number fields #Signal processing #Space-time block codes #Telecommunications #Innovative methodologies #Perfect codes #Signal constellation #Space-time block code #Data communication systems #Pattern recognition #Space-time block coding (STBC) #Telecommunication |
| Tipo |
info:eu-repo/semantics/conferencePaper |
