Complex Korkine-Zolotareff Reduction Algorithm for Full-Diversity MIMO Detection
The Korkine-Zolotareff (KZ) reduced basis is considered as the best reduced basis for use in data decoding in multiple-input multiple-output (MIMO) communication systems. In this paper, we present an improved KZ algorithm for direct application in reducing a complex lattice basis. The enumeration al...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters Jg. 17; H. 2; S. 381 - 384 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.02.2013
Institute of Electrical and Electronics Engineers |
| Schlagworte: | |
| ISSN: | 1089-7798 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The Korkine-Zolotareff (KZ) reduced basis is considered as the best reduced basis for use in data decoding in multiple-input multiple-output (MIMO) communication systems. In this paper, we present an improved KZ algorithm for direct application in reducing a complex lattice basis. The enumeration algorithm, which is the dominant contributor to the main cost of the KZ algorithm, is also modified for a complex lattice. We reduce the number of iterations in the KZ algorithm to reduce complexity without degrading performance. In addition, we show that KZ-reduction-aided decoding is capable of achieving full diversity. Simulation results demonstrate the excellent performance and low complexity of the improved algorithm. |
|---|---|
| ISSN: | 1089-7798 |
| DOI: | 10.1109/LCOMM.2013.010313.122418 |