Complex lattice reduction algorithms for low-complexity MIMO detection

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 5, Issue , 2005, Pages 2953-2957

  Gan, Ying Hung ^a   Mow, Wai Ho ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LINEAR SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL RECEIVERS;

LATTICE REDUCTION ALGORITHMS; LINEAR RECEIVERS; MAXIMUM LIKELIHOOD RECEIVERS; MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) SYSTEMS;

SIGNAL DETECTION;

EID: 33846576066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1578299     Document Type: Conference Paper

References (12)

1. W. H. Mow, "Universal lattice decoding: principle and recent advances," Wireless Communications and Mobile Computing, Special Issue on Coding and Its Applications in Wireless CDMA Systems, vol. 3, pp. 553-569, Aug. 2003.
2. _, "Maximum likelihood sequence estimation from the lattice viewpoint," Master's thesis, Chinese University of Hong Kong, June 1991.
3. _, "Maximum likelihood sequence estimation from the lattice viewpoint," IEEE Trans. Inform. Theory, vol. 40, pp. 1591-1600, Sept. 1994.
4. H. Yao and G. W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. 2002 Global Telecommunications Conference (GLOBECOM '02), vol. 1, Nov. 2002, pp. 424-428.
5. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, pp. 2389-2402, Oct. 2003.
6. D. Wubben, R. Bohnke, V. Kuhn, and K.-D. Kammeyer, "Near-maximum- likelihood detection of MIMO systems using MMSE-based lattice reduction," in Proc. 2004 International Conference on Communications (ICC04), June 2004, pp. 798-802.
7. C. Windpassinger, R. Fischer, and J. Huber, "Lattice-reduction-aided broadcast preceding," IEEE Trans. Commun., vol. 52, pp. 2057-2060, Dec. 2004.
8. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., no. 261, pp. 513-534, 1983.
9. H. Napias, "A generalization of the LLL-algorithm over euclidean rings or orders," Journal de The'one des Nombres de Bordeaux, pp. 387-396, 1996.
10. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, pp. 2202-2214, Aug. 2002.
11. G. H. Golub and C. F. van Loan, Matrix computations. Baltimore: The Johns Hopkins University Press, 1996.
12. P. Wolniansky, G. Foschini, G. Golden, and R. Valenzuela, "V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc. Signals, Systems, and Electronics, 1998. ISSSE 98. 1998 URSI International Symposium on, Sept. 1998, pp. 295-300.