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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 17; číslo 2; s. 381 - 384
Hlavní autoři: Jiang, Hua, Du, Sidan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.02.2013
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Bit error rate
Coding, codes
Decoding
Detectors
enumeration algorithm
Exact sciences and technology
full diversity
Information, signal and communications theory
Korkine-Zolotareff reduction
lattice reduction
Lattices
MIMO
multiple-input multiple-output (MIMO)
Signal and communications theory
Signal processing algorithms
Telecommunications and information theory
Vectors
Performance evaluation
MIMO system
Iterative method
lattice reduction
Decoding
multiple-input multiple-output (MIMO)
Algorithm
full diversity
Simulation
enumeration algorithm
Telecommunication system
Algorithm complexity
Korkine-Zolotareff reduction
ISSN:1089-7798
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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