Reduced-complexity LLL algorithm for lattice-reduction-aided MIMO detection

Authors:
Chun-Fu Liao;Yuan-Hao Huang
Affiliations:
Institute of Communications Engineering and Department of Eelectrical Engineering, National Tsing-Hua University, Hsinchu, Taiwan, R.O.C.;Institute of Communications Engineering and Department of Eelectrical Engineering, National Tsing-Hua University, Hsinchu, Taiwan, R.O.C.
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 3
Cited 0

Parallel lattice basis reduction

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Fixed complexity LLL algorithm

IEEE Transactions on Signal Processing
Closest point search in lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a low-complexity constant-throughput LLL algorithm for lattice-reduction-aided (LRA) multi-input multi-output (MIMO) detection. The traditional LLL algorithm for the lattice reduction has a drawback of varying throughput due to the variable iteration loops for the size-reduction and LLL-reduction checks. To address this problem, we propose a constant-throughput LLL (CT-LLL) algorithm that is well suited for real-time implementation. We further propose some techniques to reduce the redundant operations in the CTLLL algorithm so that the computational complexity can be reduced. Simulation and analysis results show that the proposed low-complexity CT-LLL algorithm reduces the complexity of the CT-LLL algorithm for 4×4 and 8×8 MIMO systems to 80% and 72.94%, respectively, with negligible performance degradation.