Sphere decoding with a probabilistic tree pruning

IEEE Transactions on Signal Processing

Volumn 56, Issue 10 I, 2008, Pages 4867-4878

  Shim, Byonghyo ^a,b   Kang, Insung ^a  

^a QUALCOMM INC   (United States)

^b Korea University   (South Korea)

Author keywords

Lattice; Maximum likelihood decoding; Multiple input multiple output (MIMO) system; Probabilistic noise constraint; Probabilistic tree pruning; Sphere constraint; Sphere decoding (SD)

Indexed keywords

DECODING; PROBABILITY; RISK ASSESSMENT; TREES (MATHEMATICS);

LATTICE; MAXIMUM LIKELIHOOD DECODING; MULTIPLE-INPUT-MULTIPLE-OUTPUT (MIMO) SYSTEM; PROBABILISTIC NOISE CONSTRAINT; PROBABILISTIC TREE PRUNING; SPHERE CONSTRAINT; SPHERE DECODING (SD);

SPHERES;

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

References (25)

1. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Meth. Computat., vol. 44, pp. 463-471, 1985.
2. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications," in Proc. ACM SIGSAM, 1981, vol. 15, pp. 37-44.
3. E. Viterbo and E. Biglieri, "A universal lattice decoder," in Proc. GRETSI 14-eme Colloque, Jun-les-pins, France, Sep. 1993, pp. 611-614.
4. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practiccal algorithms and solving subset sum problems," Math. Programm., vol. 66, pp. 181-191, 1994.
5. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
6. M. O. Damen, H. Gamel, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, pp. 2389-2402, Oct. 2003.
7. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, pp. 1639-1642, Jul. 1999.
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. B. Hassibi and H. Vikalo, "The expected complexity of sphere decoding part I: Theory," IEEE Trans. Signal Process., vol. 53, pp. 2806-2818, Aug. 2005.
10. H. Vikalo and B. Hassibi, "On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications," IEEE Trans. Signal Process., vol. 53, pp. 2819-2834, Aug. 2005.
11. W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol. 53, pp. 1104-1109, Jul. 2005.
12. R. Gowaikar and B. Hassibi, "Efficient statistical pruning for maximum likelihood decoding," in Proc. IEEE ICASSP, 2003, vol. 5, pp. 49-52.
13. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol. 55, no. 6, pp. 2661-2675, Jun. 2007.
14. D. Gesbert, M. Shafi, D. Shiu, P. Smith, and A. Naguib, "From theory to practice: An overview of MIMO space-time coded wireless systems," IEEE J. Sel. Areas Commun., vol. 21, pp. 281-302, Apr. 2003.
15. L. Babai, On Lovasz' Lattice Reduction and the Nearest Lattice Point Problem. New York: Combinatorica, 1986, vol. 6, pp. 1-13.
16. S. M. Ross, Probability Models. New York: Academic, 2000.
17. 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.
18. B. Hassibi, "An efficient square-root algorithm for BLAST," in Proc. Int. Conf. Acoust., Speech, Signal Process., Jun. 2000, pp. 5-9.
19. D. Wubben, R. Bohnke, V. Kuhn, and K. Kammeyer, "MMSE extension of V-BLAST based on sorted QR decomposition," in Proc. IEEE Vehicular Technology Conf. (VTC), Oct. 2003, pp. 508-512.
20. G. H. Golub and C. Van Loan, Matrix Computations. Baltimore, MD: The John Hopkins Univ. Press, 1993.
21. T.K. Moon and W. C. Striling, Methematical Methods and Algorithms for Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1999.
22. B. M. Hochwald and S. Brink, "Achieving near-capacity on a multiple-antenna channels," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
23. W. Zhao and G. B. Giannakis, "Reduced complexity closest point decoding algorithms for random lattices," IEEE Trans. Wireless Commun., vol. 5, no. 1, pp. 101-111, Jan. 2006.
24. A. D. Murugan, H. El Gamal, M. O. Damen, and G. Caire, "A unified framework for tree search decoding: Rediscovering the sequential decoder," IEEE Trans. Inf. Theory, vol. 52, pp. 933-953, Mar. 2006.
25. T. Cui and C. Tellambura, "Approximate ML detection for MIMO systems using multistage sphere decoding," IEEE Signal Process. Lett., vol. 12, pp. 222-225, Mar. 2005.