On the complexity of sphere decoding in digital communications

IEEE Transactions on Signal Processing

Volumn 53, Issue 4, 2005, Pages 1474-1484

  Jaldén, Joakim ^a   Ottersten, Björn ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Expected complexity; Large deviation theory; ML detection; Sphere decoding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; PROBABILITY; SIGNAL DETECTION; SIGNAL TO NOISE RATIO;

EXPECTED COMPLEXITY; LARGE DEVIATION THEORY; MAXIMUM LIKELIHOOD DETECTION; SPHERE DECODING;

DIGITAL COMMUNICATION SYSTEMS;

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

References (17)

1. T. Kailath and H. V. Poor, "Detection of stochastic processes," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2230-2231, Oct. 1998.
2. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
3. J. G. Proakis, Digital Communications, Third ed. New York: McGraw-Hill, 1995.
4. B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804-1824, Jun. 2002.
5. 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.
6. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
7. H. Vikalo and B. Hassibi, "Maximum-likelihood sequence detection of multiple antenna systems over dispersive channels via sphere decoding," EURASIP J. Appl. Signal Process., vol. 2002, no. 5, pp. 525-531, May 2002.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in lattice, including a complexity analysis," Math. Comput., vol. 44, no. 170, pp. 463-471, Apr. 1985.
9. 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.
10. B. Hassibi and H. Vikalo, "On the expected complexity of integer least-squares problems," in Proc. IEEE ICASSP, vol. 2, May 2002, pp. 1497-1500.
11. B. Hassibi, and H. Vikalo, "Maximum likelihood decoding and integer least-squares: the expected complexity," in Multiantenna Channels: Capacity, Coding and Signal Processing, J. Foschini and S. Verdu, Eds. New York: Amer. Math. Soc., 2003.
12. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley-Interscience, 1998.
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
14. S. Verdú, "Computational complexity of multiuser detection," Algorithmica, vol. 4, pp. 303-312, 1989.
15. O. Damen, K. Abed-Meraim, and M. S. Lemdani, "Further results on the sphere decoder," in Proc. ISIT, Jun. 2001, p. 333.
16. S. Ross, A First Course in Probability, Second ed. New York: Macmillan, 1984.
17. A. Shwarts and A. Weiss, Large Deviations for Performance Analysis London, U.K.: Chapman and Hall, 1995.