On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory

Volumn 49, Issue 10, 2003, Pages 2389-2402

  Damen, Mohamed Oussama ^a   El Gamal, Hesham ^b   Caire, Giuseppe ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Ohio State University   (United States)

^c EURECOM   (France)

Author keywords

Decision feedback equalization (DFE); Lattices; Maximum likelihood (ML) detection; Minimum mean square error (MMSE); Multiple input multiple output (MIMO) channels; Pohst enumeration; Sequential decoding; Stack algorithms

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION FEEDBACK EQUALIZERS; DECODING; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL DETECTION;

MAXIMUM LIKELIHOOD DETECTION; MINIMUM MEAN SQUARE ERROR; MULTIPLE INPUT MULTIPLE OUTPUT CHANNELS; POHST ENUMERATION; SEQUENTIAL DECODING; STACK ALGORITHMS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0242365586     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.817444     Document Type: Article

References (42)

1. J. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2000.
2. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications," ACM SIGSAM, vol. 15, pp. 37-44, 1981.
3. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Computation, vol. 44, pp. 463-471, Apr. 1985.
4. E. Viterbo and E. Biglieri, "A universal lattice decoder," in GRETSI 14-ème Colloque, Juan-les-Pins, France, Sept. 1993.
5. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channel," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
6. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
7. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol. 66, pp. 181-191, 1994.
8. M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice codes decoder for space-time codes," IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000.
9. E. Telatar, "Capacity of multi-antenna Gaussian channels," European Trans. Telecommun., vol. 10, no. 6, pp. 585-596, Nov. 1999.
10. G. Foschini and M. Gans, "On limits of wireless communications in a fading environment when using multiple antennas," Wireless Personal Commun., vol. 6, no. 3, pp. 311-335, Mar. 1998.
11. B. Hassibi and B. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, pp. 1804-1824, July 2002.
12. H. El Gamal and M. O. Damen, "Universal space-time coding," IEEE Trans. Inform. Theory, vol. 49, pp. 1097-1119, May 2003.
13. M. O. Damen, H. El Gamal, and N. C. Beaulieu, "Linear threaded algebraic space-time constellations," IEEE Trans. Inform. Theory, vol. 49, pp. 2372-2388, Oct. 2003.
14. J. Boutros and E. Viterbo, "Signal space diversity: A power- and bandwidth-efficient density technique for the Rayleigh fading channel," IEEE Trans. Inform. Theory, vol. 44, pp. 1453-1467, July 1998.
15. M. Debbah, P. Loubaton, and M. De Courville, "Linear precoded OFDM transmissions with MMSE equalization: Facts and results," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Orlando, FL, May 2002.
16. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
17. L. Brunel and J. Boutros, "Euclidean space lattice decoding for joint detection in CDMA systems," in Proc. IEEE Information Theory Workshop. South Africa, June 1999.
18. M. O. Damen, K. A. Meraim, and A. Safavi, "On CDMA with space-time codes over multi-path fading channels," IEEE Trans. Wireless Commun., vol. 2, pp. 11-19, Jan. 2003.
19. 2 is NP-hard for randomized reductions," in Proc. 30th Annu. ACM Symp. Theory of Computing, Dallas, TX, May 1998.
20. D. Marcciancio, "The shortest vector in a lattice is hard to approximate to within some constant," in Proc. 39th Annu. Symp. Found. Computer Science, Palo Alto, CA, Nov. 1998.
21. H. Vikalo and B. Hassibi, "The expected complexity of sphere decoding, Part I: Theory, Part II: Applications," IEEE Trans. Signal Processing, submitted for publication.
22. M. O. Damen, K. Abed-Meraim, and M. S. Lemdani, "Further results on the sphere decoder," in Proc. IEEE Int. Symp. Inform. Theory, Washington, D.C., June 2001, p. 333.
23. G. Rekaya and J.-C. Belfiore, "Complexity of ML lattice decoders for the decoding of linear full rate space-time codes," IEEE Trans. Wireless Commun., submitted for publication.
24. C. Windpassinger and R. Fischer, "Low-complexity near maximum likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Information Theory Workshop, Paris, France, Apr. 2003, pp. 345-348.
25. J. Foschini, G. Golden, R. Valenzuela, and P. Wolniansky, "Simplified processing for high spectral efficiency wireless communication employing multi-element arrays," IEEE J. Select. Areas Commun., vol. 17, pp. 1841-1852, Nov. 1999.
26. M. O. Damen, K. Abed-Meraim, and S. Burykh, "Iterative QR detection for Blast," Wireless Personal Commun., vol. 19, pp. 179-192, Dec. 2001.
27. S. Baro, J. Hagenauer, and M. Witzke, "Iterative detection of MIMO transmission using a list sequential (LISS) detector," in Proc. IEEE Int. Conf. Communications, Anchorage, AK, May 2003.
28. B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
29. J. Boutros, N. Gresset, L. Brunel, and M. Fossorier, "Soft-input soft-output lattice sphere decoder for linear channels," in Proc. IEEE Global Communications Conf., to be published.
30. H. Vikalo and B. Hassibi, "Iterative decoding for MIMO channels via modified sphere decoder," IEEE Trans. Wireless Commun., submitted for publication.
31. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for multi-antenna modulation and detection," IEEE Trans. Commun., submitted for publication.
32. A. Viterbi and J. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
33. J. H. Conway and N. J. Sloane, Sphere Packing, Lattices and Groups, 3rd ed. New York: Springer-Verlag, 1998.
34. R. Gallagher, Information Theory and Reliable Communication. New York: Wiley, 1968.
35. A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515-534, 1982.
36. M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, "Generalized sphere decoder for asymmetrical space-time communication architecture," Electron. Lett., vol. 36, p. 166, Jan. 2000.
37. B. Hassibi, "An efficient square-root algorithm for Blast," IEEE Trans. Signal Processing. [Online]. Available: http://mars.bell-labs.com, submitted for publication.
38. S. Shamai (Shitz) and R. Laroia, "The intersymbol interference channel: Lower bounds on capacity and channel precoding loss," IEEE Trans. Inform. Theory, vol. 42, pp. 1388-1404, Sept. 1996.
39. A. Duel-Hallen and C. Heegard, "Delayed decision-feedback sequence estimation," IEEE Trans. Commun., vol. 37, pp. 428-436, May 1989.
40. G. Caire and G. Colavolpe, "On space-time coding for quasistatic multiple-antenna channels," IEEE Trans. Inform. Theory, vol. 49, pp. 1400-1416, June 2003.
41. G. D. Forney Jr., "Coset codes-part I: Introduction and geometrical classification," IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, Sept. 1988.
42. ____, "Coset codes-part II: Binary lattice and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1151-1186, Sept. 1988.