Open Access

Efficient Near Maximum-Likelihood Detection for Underdetermined MIMO Antenna Systems Using a Geometrical Approach

EURASIP Journal on Wireless Communications and Networking20072007:084265

DOI: 10.1155/2007/84265

Received: 9 January 2007

Accepted: 10 October 2007

Published: 9 December 2007


Maximum-likelihood (ML) detection is guaranteed to yield minimum probability of erroneous detection and is thus of great importance for both multiuser detection and space-time decoding. For multiple-input multiple-output (MIMO) antenna systems where the number of receive antennas is at least the number of signals multiplexed in the spatial domain, ML detection can be done efficiently using sphere decoding. Suboptimal detectors are also well known to have reasonable performance at low complexity. It is, nevertheless, much less understood for obtaining good detection at affordable complexity if there are less receive antennas than transmitted signals (i.e., underdetermined MIMO systems). In this paper, our aim is to develop an effcient detection strategy that can achieve near ML performance for underdetermined MIMO systems. Our method is based on the geometrical understanding that the ML point happens to be a point that is "close" to the decoding hyperplane in all directions. The fact that such proximity-close points are much less is used to devise a decoding method that promises to greatly reduce the decoding complexity while achieving near ML performance. An average-case complexity analysis based on Gaussian approximation is also given.


Authors’ Affiliations

Adastral Park Research Campus, University College London
Information Systems Laboratory, Stanford University


  1. Foschini GJ, Gans MJ: On limits of wireless communications in a fading environment when using multiple antennas. Wireless Personal Communications 1998,6(3):311-335. 10.1023/A:1008889222784View ArticleGoogle Scholar
  2. Tarokh V, Seshadri N, Calderbank AR: Space-time codes for high data rate wireless communication: performance criterion and code construction. IEEE Transactions on Information Theory 1998,44(2):744-765. 10.1109/18.661517MATHMathSciNetView ArticleGoogle Scholar
  3. Fincke U, Phost M: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation 1985,44(170):463-471. 10.1090/S0025-5718-1985-0777278-8MATHMathSciNetView ArticleGoogle Scholar
  4. Mow WH: Maximum likelihood sequence estimation from the lattice viewpoint. IEEE Transactions on Information Theory 1994,40(5):1591-1600. 10.1109/18.333872MATHView ArticleGoogle Scholar
  5. Damen O, Chkeif A, Belfiore J-C: Lattice code decoder for space-time codes. IEEE Communications Letters 2000,4(5):161-163. 10.1109/4234.846498View ArticleGoogle Scholar
  6. Hassibi B, Vikalo H: On the sphere-decoding algorithm—I: expected complexity. IEEE Transactions on Signal Processing 2005,53(8):2806-2818.MathSciNetView ArticleGoogle Scholar
  7. Vikalo H, Hassibi B: On the sphere-decoding algorithm—II: generalizations, second-order statistics, and applications to communications. IEEE Transactions on Signal Processing 2005,53(8):2819-2834.MathSciNetView ArticleGoogle Scholar
  8. Viterbo E, Boutros J: A universal lattice code decoder for fading channels. IEEE Transactions on Information Theory 1999,45(5):1639-1642. 10.1109/18.771234MATHMathSciNetView ArticleGoogle Scholar
  9. Sidiropoulos ND, Luo Z-Q: A semidefinite relaxation approach to MIMO detection for high-order QAM constellations. IEEE Signal Processing Letters 2006,13(9):525-528.View ArticleGoogle Scholar
  10. Guo Z, Nilsson P:Algorithm and implementation of the -best Sphere decoding for MIMO detection. IEEE Journal on Selected Areas in Communications 2006,24(3):491-503.View ArticleGoogle Scholar
  11. Xie Y, Li Q, Georghiades CN: On some near optimal low complexity detectors for MIMO fading channels. IEEE Transactions on Wireless Communications 2007,6(4):1182-1186.View ArticleGoogle Scholar
  12. Tse D, Viswanath P: On the capacity of the multiple antenna broadcast channel. In Proceedings of the DIMACS Workshop on Signal Processing for Wireless Transmission, October 2002, Piscataway, NJ, USA, Series Discrete Math. and Theoretical Computer Science. American Mathematical Society;Google Scholar
  13. Vishwanath S, Jindal N, Goldsmith A: Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels. IEEE Transactions on Information Theory 2003,49(10):2658-2668. 10.1109/TIT.2003.817421MATHMathSciNetView ArticleGoogle Scholar
  14. Vikalo H, Hassibi B, Kailath T: Iterative decoding for MIMO channels via modified sphere decoding. IEEE Transactions on Wireless Communications 2004,3(6):2299-2311. 10.1109/TWC.2004.837271View ArticleGoogle Scholar
  15. Damen MO, Abed-Meraim K, Belfiore J-C: Generalized sphere decoder for asymmetrical space-time communication architecture. Electronics Letters 2000,36(2):166-167. 10.1049/el:20000168View ArticleGoogle Scholar
  16. Yang Z, Liu C, He J: A new approach for fast generalized sphere decoding in MIMO Systems. IEEE Signal Processing Letters 2005,12(1):41-44.MATHView ArticleGoogle Scholar
  17. Chan AM, Lee I: A new reduced-complexity sphere decoder for multiple antenna systems. Proceedings of IEEE International Conference on Communications (ICC '02), April-May 2002, New York, NY, USA 1: 460-464.View ArticleGoogle Scholar
  18. Wong K-K, Paulraj A: On the decoding order of MIMO maximum-likelihood sphere decoder: linear and non-linear receivers. Proceedings of IEEE 59th Vehicular Technology Conference (VTC '04), May 2004, Milan, Italy 2: 698-702.Google Scholar


© K.-K.Wong and A. Paulraj 2007

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.