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

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2008, Pages 2685-2688

  Jaldén, Joakim ^a   Seethaler, Dominik ^b   Matz, Gerald ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ETH ZURICH   (Switzerland)

Author keywords

Complexity; Decoding; Lattice reduction; LLL; MIMO; Preceding

Indexed keywords

ACOUSTICS; COMMUNICATION CHANNELS (INFORMATION THEORY); FADING (RADIO); FADING CHANNELS; MIM DEVICES; MULTIPLEXING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SIGNAL PROCESSING; SPEECH;

COMPLEXITY; DECODING; LATTICE REDUCTION; LLL; MIMO; PRECEDING;

RAYLEIGH FADING;

EID: 51449122912     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2008.4518202     Document Type: Conference Paper

References (12)

1. H. Yao and G. W. Wornell, "Lattice reduction aided detectors for MIMO communication systems," in Proc. IEEE Global Telecommunications Conference, GLOBECOM, Taipei (Taiwan), Nov. 2002, pp. 424-428.
2. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
3. M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2389-2401, Oct. 2003.
4. C. Windpassinger, R. F. H. Fischer, and J. B. Huber, "Lattice- reduction-aided broadcast precoding," IEEE Transactions on Communications, vol. 52, no. 12, pp. 2057-2060, Dec. 2004.
5. M. Taherzadeh, A. Mobasher, and A. K. Khandani, "LLL reduction achieves the receive diversity in MIMO decoding," IEEE Transactions on Information Theory, 2006, submitted.
6. A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515-534, 1982.
7. Y. H. Gan and W. H. Mow, "Complex lattice reduction algorithms for low-complexity MIMO detection," in Proc. IEEE Global Telecommunications Conference, GLOBECOM, St. Louis (MO), Nov. 2005, pp. 2953-2957.
8. H. Daudé and B. Vallée, "An upper bound on the average number of iterations of the LLL algorithm," Theoretical Computer Science, vol. 123, no. 1, pp. 95-115, Jan. 1994.
9. C. Ling and N. Howgrave-Graham, "Effective LLL reduction for lattice decoding," in Proc. IEEE International Symposium on Information Theory, ISIT, June 2007.
10. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1985.
11. B. Vallée, "The Gauss' algorithm revisited," Journal of Algorithms, vol. 12, no. 4, pp. 556-572, Dec. 1991.
12. C. Chen and J. J. Dongarra, "Condition numbers of Gaussian random matrices," SIAM Journal on Matrix Analysis and Applications, vol. 27, no. 3, pp. 603-620, 2005.