Statistical pruning for near-maximum likelihood decoding

IEEE Transactions on Signal Processing

Volumn 55, Issue 6 I, 2007, Pages 2661-2675

  Gowaikar, Radhika ^a   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

Maximum likelihood decoding; Multiple antenna systems; Reduced complexity; Sphere decoder

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; MAXIMUM LIKELIHOOD; STATISTICS;

MULTIPLE ANTENNA SYSTEMS; REDUCED COMPLEXITY; SPHERE DECODER;

DECODING;

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

References (29)

1. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs. Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
2. B. Hassibi and B. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804-1824, Jul. 2002.
3. M. 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.
4. B. Hassibi, "An efficient square-root algorithm for BLAST," in Proc. IEEE Inf. Conf. Acoustics, Speech, Signal Process., Jun. 2000, vol. 2, pp. 11737-11740.
5. R. Kannan, "Improved algorithms on integer programming and related lattice problems," in Proc. 15th Annu. ACM Symp. Theory of Computing 1983, pp. 193-206.
6. J. Lagarias, H. Lenstra, and C. Schnorr, "Korkin-Zoloiarev bases and successive minima of a lattice and its reciprocal," Combinatorica vol. 10, pp. 333-348, 1990.
7. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, April 1985.
8. J. Gross and J. Yellen, Graph Theory Appl.. Boca Raton, FL: CRC, 1998.
9. M. Stojnic, H. Vikalo, and B. Hassibi, "A branch and bound approach to speed up the sphere decoder," in IEEE Int. Conf. Acoustics, Speech, Signal Processing, 2005, pp. iii/429-iii/432.
10. A. Banihashemi and A. Khandani, "On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis," IEEE Trans. Inf. Theory vol. 44, no. 2, pp. 162-171, Mar. 1998.
11. 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.
12. M. Ajtai, "Generating hard instances of lattice problems," in Proc. 28th Annual ACM Symp. Theory of Computing, 1996, pp. 99-108.
13. H. Vikalo and B. Hassibi, "On the sphere decoding algorithm. I. Expected complexity II. Generalizations, second-order statistics, and applications to communications," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2834, Aug. 2005.
14. J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
15. R. Gowaikar and B. Hassibi, "Efficient statistical pruning for maximum likelihood decoding," in Proc. IEEE ICASSP, 2003, pp. 49-52.
16. M. O. Damen, H. E. 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.
17. K. Su and I. J. Wassell, "A new ordering for efficient sphere decoding," in Proc. IEEE Int. Conf. Communications, 2005, pp. 1906-1910.
18. C. Windpassinger, R. F. H. Fischer, and J. B. Huber, "Lattice-reduction-aided broadcast precoding," IEEE Trans. Commun. vol. 52, no. 12, pp. 2057-2060, Dec. 2004.
19. W. Xu, Y. Wang, Z. Zhou, and J. Wang, "Joint ML channel estimation and data detection for stbc via novel sphere decoding algorithms," in Proc. IEEE Vehicular Technology Conf., 2005, pp. 434-437.
20. W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol. 53, no. 7, pp. 1104-1109, Jul. 2005.
21. R. Gowaikar and B. Hassibi, "Efficient near-ml decoding via statistical pruning," in Proc. IEEE Int. Symp. Information Theory, 2003, p. 274.
22. B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
23. M. Grotschel, L. Lovasz, and A. Schriver, Geometric Algorithms and Combinatorial Optimization, 2nd ed. New York: Springer-Verlag, 1993.
24. J. Y. Cai, "On the average-case hardness of CVP," in Proc. IEEE Symp. Foundations of Computer Science, 2001, pp. 308-317.
25. A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner, and H. Boelcskei, "Vlsi implementation of mimo detection using the sphere decoding algorithm," IEEE J. Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, Jul. 2005.
26. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," Tech. Rep. [Online]. Available: Htlp:// www.ee.caltech.edu)gowaikar/pubs/report.pdf
27. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
28. H. Vikalo and B. Hassibi, "On joint ML detection and decoding for linear block codes," in Proc. IEEE ISIT, 2003, p. 275.
29. A. Edelman, "Eigenvalues and condition numbers of random matrices," Ph.D. thesis, Dept. Math., Massachusetts Inst. Technol., Cambridge, 1989.