Abstract
Iterative decoding algorithms for I-Q space-time (ST) codes were presented. I-Q ST codes have the potential to provide high coding gains in rapid fading environments. The optimal decoding of I-Q ST codes involved the use of the super-trellis of the I and Q codes. The proposed algorithms have similar performance to optimal decoding with much lower complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 389 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics