Fixed complexity LLL algorithm

Authors:
Henning Vetter;Vishakan Ponnampalam;Magnus Sandell;Peter Adam Hoeher
Affiliations:
Telecommunications Research Laboratory, Toshiba Research Europe Ltd., Bristol, U.K.;Mediatek USA, San Jose, CA and Toshiba Research Europe Ltd., Bristol, U.K.;Telecommunications Research Laboratory, Toshiba Research Europe Ltd., Bristol, U.K.;Information and Coding Theory Lab, Faculty of Engineering, University of Kiel, Kiel, Germany
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 2
Cited 3

Parallel lattice basis reduction

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Complexity of Lattice Problems

Complexity of Lattice Problems

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

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Implementation of a reduced-lattice MIMO detector for OFDM systems

Proceedings of the Conference on Design, Automation and Test in Europe
Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors

Computers and Electrical Engineering

Quantified Score

Hi-index	35.68

Visualization

Abstract

A common technique to perform lattice basis reduction is the Lenstra, Lenstra, Lovász (LLL) algorithm. An implementation of this algorithm in real-time systems suffers from the problem of variable run-time and complexity. This correspondence proposes a modification ofthe LLL algorithm. The signal flow is altered to follow a deterministic structure, which promises to obtain an easier implementation as well as a fixed execution time known in advance. In the case of a maximum number of iterations as it is likely in real-time systems, our modification clearly outperforms the original LLL algorithm as far as the quality of the reduced lattice basis is concerned.