Abstract
In order to make multi-antenna OFDM systems an attractive choice for practical applications, implementation issues such as decoding complexity must be addressed successfully. In this paper, we propose a computationally efficient decoding algorithm for space-frequency block codes. The central part of the algorithm is a complex-domain, modulation-independent sphere decoding framework. The simulation results demonstrate that the proposed algorithm can significantly reduce the decoding complexity. For 64 QAM modulation, we observe up to about 73% reduction in the required FLOP count per code block compared to previously proposed methods without noticeable performance degradation.
| Original language | English |
|---|---|
| Pages (from-to) | 2591-2595 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 5 |
| State | Published - 2004 |
| Event | 2004 IEEE International Conference on Communications - Paris, France Duration: Jun 20 2004 → Jun 24 2004 |
Fingerprint
Dive into the research topics of 'A fast sphere decoding framework for space-frequency block codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver