Reduced complexity closest point decoding algorithms for random lattices

IEEE Transactions on Wireless Communications

Volumn 5, Issue 1, 2006, Pages 101-111

  Zhao, Wanlun ^a,b   Giannakis, Georgios B ^a,b,c,d  

^a IEEE   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c University of Minnesota   (United States)

^d Department of Wireless Telecommunications ^*  (United States)

Author keywords

Closest point algorithm; Lenstra; Lovasz (LLL) lattice reduction; Multiuser detection; Random lattice decoding; Space time; Sphere decoding

Indexed keywords

LENSTRA; MULTIUSER DETECTION; RANDOM LATTICE DECODING; SPACE-TIME; SPHERE DECODING;

ALGORITHMS; ANTENNA ARRAYS; COMPUTATIONAL COMPLEXITY; DECODING; PROBABILITY; USER INTERFACES;

CARRIER COMMUNICATION;

EID: 31144444294     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2006.1576534     Document Type: Article

References (20)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
2. L. Babai, "On Lovasz' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
3. L. Brunel and J. Boutros, "Euclidean space lattice decoding for joint detection in CDMA systems," in Proc. Information Theory Workshop, Kruger National Park, South Africa, Jun. 1999, p. 129.
4. N. Balakrishnan and A. C. Cohen, Order Statistics and Inference Estimation Methods. New York: Academic, 1991.
5. A. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," in Proc. Int. Conf. Communications, New York, Apr. 28-May 2, 2002, vol. 1, pp. 460-464.
6. H. Cohen, A Course in Computational Algebraic Number Theory. Berlin, Germany: Springer-Verlag, 1993.
7. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, 3rd ed. New York: Springer-Verlag, 1999.
8. M. O. Damen, H. El Gamal, and G. Caire, "On maximum likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
9. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, no. 170, pp. 463-471, Apr. 1985.
10. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multielement antennas," Bell Labs Tech. J., vol. 1, no. 2, pp. 41-49, Autumn 1996.
11. A. K. Gupta and D. K. Nagar, Matrix Variate Distributions. Boca Raton, FL: CRC, 2000.
12. B. Hassibi and H. Vikalo, "On the expected complexity of sphere decoding," in Proc. 35th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2001, pp. 1051-1055.
13. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multipleantenna channel," IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
14. R. Kannan, "Improved algorithms for integer programming and related lattice problems," in Proc. 15th Annu. ACM Symp. Theory Computing, Boston, MA, Apr. 1983, pp. 193-206.
15. A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, no. 4, pp. 513-534, 1982.
16. J. Luo, K. Pattipati, P. Willett, and L. Brunel, "Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA," in Proc. Int. Conf. Communications, Anchorage, AK, May 11-15, 2003, pp. 3336-3340.
17. X. Ma and G. B. Giannakis, "Full-diversity full-rate complex-field space-time coding," IEEE Trans. Signal Process., vol. 51, no. 11, pp. 2917-2930, Nov. 2003.
18. R. J. Muirhead, Aspects of Multivariate Statistical Theory. New York: Wiley, 1982.
19. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
20. Y. Xin, Z. Wang, and G. B. Giannakis, "Space-time diversity systems based on linear constellation preceding," IEEE Trans. Wireless Commun., vol. 2, no. 2, pp. 294-309, Mar. 2003.