Share Email Print

Proceedings Paper

Irreducible root systems for space-time coding in wireless communication
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 23 July 2003
PDF: 9 pages
Proc. SPIE 5100, Digital Wireless Communications V, (23 July 2003); doi: 10.1117/12.486828
Show Author Affiliations
Bruno R. Andriamanalimanana, SUNY Institute of Technology (United States)
Profesy International Inc. (United States)

Published in SPIE Proceedings Vol. 5100:
Digital Wireless Communications V
Raghuveer M. Rao; Soheil A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?