Translator Disclaimer
23 July 2003 Irreducible root systems for space-time coding in wireless communication
Author Affiliations +
The theory of groups and group representations have been shown by several researchers to generate promising space-time codes for multiple-antenna links in wireless communication. In this report, potential codes from a root system in a real Euclidean space are examined. In particular, general properties of codes from the infinite irreducible systems Al, Bl, Cl, and Dl are analytically studied, while codes from the exceptional systems G2, F4, E6, E7 and E8 are numerically determined. Some of these exceptional codes meet general coding-theoretic expectations, for example in terms of the number of code words. The effort described in this paper is part of a general attempt to assess the use of modular representations of groups, as opposed to classical, i.e. complex-numbered, representations, for antenna diversity. Java technologies are used for the implementation of our numerical experimentation platform.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bruno R. Andriamanalimanana "Irreducible root systems for space-time coding in wireless communication", Proc. SPIE 5100, Digital Wireless Communications V, (23 July 2003);


Back to Top