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.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[3]  Amir K. Khandani,et al.  LLL Reduction Achieves the Receive Diversity in MIMO Decoding , 2006, IEEE Transactions on Information Theory.

[4]  Brigitte Vallée,et al.  An Upper Bound on the Average Number of Iterations of the LLL Algorithm , 1994, Theor. Comput. Sci..

[5]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[6]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[7]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[8]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[9]  Brigitte Vallée,et al.  Gauss' Algorithm Revisited , 1991, J. Algorithms.

[10]  Cong Ling,et al.  Effective LLL Reduction for Lattice Decoding , 2007, 2007 IEEE International Symposium on Information Theory.

[11]  Wai Ho Mow,et al.  Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection , 2006, ArXiv.

[12]  Zizhong Chen,et al.  Condition Numbers of Gaussian Random Matrices , 2005, SIAM J. Matrix Anal. Appl..