A Comparison of Complex Lattice Reduction Algorithms for MIMO Detection

The performance and complexity of two complex lattice reduction (LR) algorithms used in multiple input-multiple output (MIMO) detection are compared in this paper. The Seysen's Algorithm (SA) has been previously proposed as a low-complexity alternative to the real version of the Lenstra-Lenstra...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE International Conference on Acoustics, Speech and Signal Processing pp. 2705 - 2708
Main Authors Barbero, L.G., Ratnarajah, T., Cowan, C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2008
Subjects
Councils
Detectors
Interference cancellation
lattice reduction
Lattices
LLL algorithm
Maximum likelihood detection
MIMO
Polynomials
Quadrature amplitude modulation
Receiving antennas
Seysen's algorithm
Silicon carbide
Online AccessGet full text
ISBN9781424414833
1424414830
ISSN1520-6149
DOI10.1109/ICASSP.2008.4518207

Cover

More Information
Summary:The performance and complexity of two complex lattice reduction (LR) algorithms used in multiple input-multiple output (MIMO) detection are compared in this paper. The Seysen's Algorithm (SA) has been previously proposed as a low-complexity alternative to the real version of the Lenstra-Lenstra-Lovasz (LLL) algorithm while providing a better performance in LR-aided linear detectors. However, this paper shows that the SA has a higher complexity than the complex version of the LLL algorithm, due to its more computationally intensive preprocessing stage and its higher complexity per iteration. In addition, both the SA and the complex LLL algorithm provide practically the same performance when used in LR-aided successive interference cancellation (SIC) detectors.
ISBN:9781424414833
1424414830
ISSN:1520-6149
DOI:10.1109/ICASSP.2008.4518207