Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection

IEEE Transactions on Signal Processing

Volumn 57, Issue 7, 2009, Pages 2701-2710

  Gan, Ying Hung ^a   Ling, Cong ^b   Mow, Wai Ho ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Complex valued algorithm; Complexity reduction; Lattice reduction; Multiinput multioutput (MIMO)

Indexed keywords

CHANNEL MATRICES; COMPLEX-VALUED ALGORITHM; COMPLEXITY REDUCTION; FULL DIVERSITY; LATTICE DECODERS; LATTICE REDUCTION; LATTICE-REDUCTION-AIDED; LLL ALGORITHM; LLL-REDUCTION; LOW-COMPLEXITY; LOWER COMPLEXITY; MAXIMUM-LIKELIHOOD RECEIVERS; MIMO DETECTION; MULTI-INPUT MULTI-OUTPUT; MULTIINPUT MULTIOUTPUT (MIMO); REDUCTION ALGORITHMS; SIMULATION RESULT; UPPER BOUND;

BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); DETECTORS; MAXIMUM LIKELIHOOD ESTIMATION; MULTIPLEXING;

ALGORITHMS;

EID: 67650165294     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2016267     Document Type: Article

References (32)

1. W. H. Mow, "Maximum Likelihood Sequence Estimation From the Lattice Viewpoint," Master's thesis, Chinese Univ. Hong Kong, Hong Kong, 1991.
2. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," IEEE Trans. Inf. Theory, vol. 40, pp. 1591-1600, Sep. 1994.
3. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications," ACM SIGSAM Bull., no. 15, pp. 37-44, 1981.
4. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I: Expected complexity," IEEE Trans. Signal Process., vol. 53, pp. 2806-2818, Aug. 2005.
5. J. Jalden and B. Ottersen, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, pp. 1474-1484, Apr. 2005.
6. W. H. Mow, "Universal lattice decoding: Principle and recent advances," Wireless Commun. Mobile Comput., Special Issue on Coding and Its Appl. Wireless CDMA Syst., vol. 3, pp. 553-569, Aug. 2003.
7. Y. H. Gan and W. H. Mow, "Complex lattice reduction algorithms for low-complexity MIMO detection," in Proc. IEEE Global Telecommun. Conf. (IEEE GLOBECOM '05), 2005, vol. 5, pp. 5-5.
8. H. Yao and G. W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. 2002 Global Telecommun. Conf. (GLOBECOM '02), Nov. 2002, vol. 1, pp. 424-428.
9. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, pp. 2389-2402, Oct. 2003.
10. C. Windpassinger and R. Fischer, "Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Inf. Theory Workshop, Paris, France, Mar. 2003, pp. 345-348.
11. D. Wübben, R. Böhnke, V. Kuhn, and K.-D. Kammeyer, "Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction," in Proc. 2004 Int. Conf. Commun. (ICC'04 , Jun. 2004, pp. 798-802.
12. A. K. Lenstra, H. W. Lenstra, Jr, and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515-534, Dec. 1982.
13. H. Napias, "A generalization of the LLL-algorithm over euclidean rings or orders," J. The'orie des Nombres de Bordeaux, pp. 387-396, 1996.
14. H. Minkowski, Geometrie der Zahlen. Leipzig, Germany: Teubner-Verlag, 1896.
15. A. Korkine and G. Zolotareff, "Sur les forms quadratiques," Math. Ann., vol. 6, pp. 366-389.
16. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, pp. 2202-2214, Aug. 2002.
17. J. W. S. Cassels, An Introduction to the Geometry of Numbers. Berlin, Germany: Springer-Verlag, 1971.
18. H. Cohen, A Course in Computational Algebraic Number Theory. Berlin, Germany: Springer-Verlag, 1993.
19. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers. Amsterdam, The Netherlands: Elsevier, 1987.
20. D. Wübben, R. Böhnke, J. Rinas, V. Kühn, and K. D. Kammeyer, "Efficient algorithm for decoding layered space-time codes," Electron. Lett., vol. 37, pp. 1348-1350, 2001.
21. A. Akhavi, "The optimal LLL algorithm is still polynomial in fixed dimension," Theoret. Comp. Sci., vol. 297, pp. 3-23, Mar. 2003.
22. H. Daudé and B. Vallée, "An upper bound on the average number of iterations of the LLL algorithm," Theoret. Comp. Sci., vol. 123, pp. 95-115, 1994.
23. C. Ling and N. Howgrave-Graham, "Effective LLL reduction for lattice decoding," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Nice, France, Jun. 2007.
24. G. H. Golub and C. F. van Loan, Matrix Computations. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
25. C. Windpassinger, R. Fischer, and J. Huber, "Lattice-reduction-aided broadcast precoding," IEEE Trans. Commun., vol. 52, pp. 2057-2060, Dec. 2004.
26. M. Taherzadeh, A. Mobasher, and A. K. Khandani, "LLL reduction achieves the receive diversity in MIMO decoding," IEEE Trans. Inf. Theory, vol. 53, pp. 4801-4805, Dec. 2007.
27. X. Ma and W. Zhang, "Performance analysis for V-BLAST systems with lattice-reduction aided linear equalization," IEEE Trans. Commun. vol. 56, pp. 309-318, Feb. 2008.
28. M. Taherzadeh and A. K. Khandani, "On the limitations of the naive lattice decoding," in Proc. IEEE Int. Symp. Inf. Theory (ISIT , Nice, France, Jun. 2007.
29. C. Ling, "Towards characterizing the performance of approximate lattice decoding," in Int. Symp. Turbo Codes/Int. ITG Conf. Source Channel Coding '06, Munich, Germany, Apr. 2006.
30. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
31. P. Dayal and M. K. Varanasi, "An algebraic family of complex lattices for fading channels with application to space-time codes," IEEE Trans. Inf. Theory, vol. 51, pp. 4184-4202, 2005.
32. G. Wang, H. Liao, H. Wang, and X.-G. Xia, "Systematic and optimal cyclotomic lattices and diagonal space-time block code designs," IEEE Trans. Inf. Theory, vol. 50, pp. 3348-3360, Dec. 2004.