Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems

Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and to reduce the complexity of optimal MIMO detectors. The complexity of the LLL algorithm is often cited as polynomial in the dimension of the lattice. In this paper we argue that this statement is not correct when made in the MIMO context. Specifically, we demonstrate that in typical communication scenarios the worst-case complexity of the LLL algorithm is not even finite. For i.i.d. Rayleigh fading channels, we further prove that the average LLL complexity is polynomial and that the probability for an atypically large number of LLL iterations decays exponentially.

• Type: Conference
• Year: 2008
• Where: ICASSP
• Authors: Joakim Jalden, Dominik Seethaler, Gerald Matz
• Keywords: Average Lll Complexity, ICASSP 2008, LLL Algorithm, Optimal Mimo Detectors, Signal Processing