Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection

DOI10.1155/2012/876380MaRDI QIDQ415838zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chun-Fu Liao, Li-Wei Chai, Yuan-Hao Huang

Publication date 9 May 2012

Published in Journal of Electrical and Computer Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/876380

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

Summary: We propose a loop-reduction LLL (LR-LLL) algorithm for lattice-reduction-aided (LRA) multi-input multioutput (MIMO) detection. The LLL algorithm is an iterative algorithm that contains many check and process operations; however, the traditional LLL algorithm itself possesses a lot of redundant check operations. To solve this problem, we propose a look-ahead check technique that not only reduces the complexity of the LLL algorithm but also produces the lattice-reduced matrix which obeys the original LLL criterion. Simulation results show that the proposed LR-LLL algorithm reduces the average number of loops or computation complexity. Besides, it also shortens the latency of \textit{clock cycles} about 19.4\%, 29.1\%, and 46.1\% for \(4 \times 4, 8 \times 8\), and \(12 \times 12\) MIMO systems, respectively.

Recommendations

• The diagonal reduction algorithm using fast Givens
• An improved LLL algorithm
• Progress on LLL and lattice reduction
• Analysis of the upper bound on the complexity of LLL algorithm
• Fast LLL-type lattice reduction

Cites work

• Closest point search in lattices
• Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
• Factoring polynomials with rational coefficients

Cited in

(6)

• Practical aspects of preprocessing techniques for K-best tree search MIMO detectors
• The diagonal reduction algorithm using fast Givens
• Improved Lattice Reduction-Aided MIMO Successive Interference Cancellation Under Imperfect Channel Estimation
• Exploration of Lattice Reduction Aided Soft-Output MIMO Detection on a DLP/ILP Baseband Processor
• Lattice-reduction-aided and integer-forcing equalization
• Lattice-basis reduction precoding based on successive interference cancellation design for multiuser MIMO downlink system

This page was built for publication: Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415838)