Efficient soft-input soft-output tree detection via an improved path metric

IEEE Transactions on Information Theory

Volumn 58, Issue 3, 2012, Pages 1518-1533

  Choi, Jun Won ^a   Shim, Byonghyo ^b   Singer, Andrew C ^c  

^a QUALCOMM INC   (United States)

^b Korea University   (South Korea)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Iterative detection and decoding (IDD); k best search; list sphere decoding; look ahead path metric; M algorithm; soft input soft output detection; tree detection; turbo principle

Indexed keywords

ITERATIVE DETECTION AND DECODING; K-BEST SEARCH; LIST SPHERE DECODING; LOOK-AHEAD; M-ALGORITHMS; SOFT INPUT SOFT OUTPUT; TURBO PRINCIPLE;

ALGORITHMS; DECODING; DETECTORS; FORESTRY; GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; SPHERES;

TREES (MATHEMATICS);

ALGORITHMS; CODING; COMMUNICATION; DETECTORS; SIMULATION; SYMBOLS;

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

References (49)

1. M. Tüchler, R. Koetter, and A. C. Singer, "Turbo equalization: Principles and new results," IEEE Trans. Commun., vol. 50, no. 5, pp. 754-767, May 2002.
2. M. Sellathurai and S. Haykin, "Turbo-BLAST for wireless communications: Theory and experiments," IEEE Trans. Signal Process., vol. 50, no. 10, pp. 2538-2546, Oct. 2002.
3. B. Hochwald and S. T. Brink, "Achieving near-capacity on a multipleantenna channel," IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
4. H. Vikalo, B. Hassibi, and T. Kailath, "Iterative decoding for MIMO channels via modified sphere decoding," IEEE Trans. Wireless Commun., vol. 3, no. 6, pp. 2299-2311, Nov. 2004.
5. X. Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, no. 7, pp. 1046-1061, Jul. 1999.
6. C. Berrou and A. Glavieux, "Near optimum error-correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
7. P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding," Eur. Trans. Telecommun., vol. 8, pp. 119-125, Mar. 1997.
8. R. Wang and G. B. Giannakis, "Approaching MIMO channel capacity with soft detectionbased on hard sphere decoding," IEEE Trans. Commun., vol. 54, no. 4, pp. 587-590, Apr. 2006.
9. J. Jaldén and B. Ottersten, "Parallel implementation of a soft output sphere decoder," in Proc. IEEE Ashilomar Conf. Signals, Syst., Comput., Nov. 2005, pp. 581-585.
10. C. Studer, A. Burg, and H. Bölcskei, "Soft-output sphere decoding: Algorithms and VLSI implementation," IEEE J. Sel. Areas Commun., vol. 26, no. 2, pp. 290-300, Feb. 2008.
11. Y. L. C. de Jong and T. J. Wilink, "Iterative tree search detection for MIMO wireless systems," IEEE Trans. Commun., vol. 53, no. 6, pp. 930-935, Jun. 2005.
12. D. L. Milliner, E. Zimmermann, J. R. Barry, and G. Fettweis, "A fixed-complexity smart candidate adding algorithm for soft output MIMO detection," IEEE J. Sel. Topics Signal Process., vol. 3, no. 6, pp. 1016-1025, Dec. 2009.
13. J. Hagenauer and C. Kuhn, "The list-sequential (LISS) algorithm and its application," IEEE Trans. Commun., vol. 55, no. 5, pp. 918-928, May 2007.
14. L. G. Barbero and T. S. Thompson, "Extending a fixed-complexity sphere decoder to obtain likelihood information for turbo-MIMO systems," IEEE Trans. Veh. Technol., vol. 57, no. 5, pp. 2804-2814, Sep. 2008.
15. E. G. Larsson and J. Jaldén, "Fixed-complexity soft MIMO detection via partial marginalization," IEEE Trans. Signal Process., vol. 56, no. 8, pp. 3397-3407, Aug. 2008.
16. D. Wu, J. Eilert, R. Asghar, and D. Liu, "VLSI implementation of a fixed-complexity soft-output MIMO detector for high-speed wireless," EURASIP J. Wireless Commun. Network., vol. 2010, pp. 1-13, 2010.
17. A. D. Murugan, H. E. Gamal, M. O. Damen, and G. Caire, "A unified framework for tree search decoding: Rediscovering the sequential decoder," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 933-953, Mar. 2006.
18. 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, Apr. 1985.
19. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm: I. Expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
20. J. Jaldén, L. G. Babero, B. Ottersten, and J. S. Thompson, "Full diversity detection in MIMO systems with a fixed-complexity sphere decoder," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Apr. 2007, pp. III-49-III-52.
21. J. B. Anderson and S. Mohan, "Sequential coding algorithms: A survey and cost analysis," IEEE Trans. Commun., vol. COM-32, no. 2, pp. 169-176, Feb. 1984.
22. K. Wong, C. Tsui, R. S. Cheng, and W. Mow, "A VLSI architecture of the K-best lattice decoding algorithm for MIMO channels," in Proc. IEEE Int. Symp. Circuits Syst., May 2002, pp. 273-276.
23. Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 491-503, Mar. 2006.
24. P. W.Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, "V-BLAST: An architecture for realizaing very high data rates over the rich-scattering wireless channel," in Proc. URSI Int. Symp. Signals, Syst., Electron., Sep. 1998, pp. 295-300.
25. J. N. Nilsson, Principle of Artificial Intelligence. Palo Alto, CA: Tioga Publ. Co., 1980.
26. Y. S. Han, C. R. P. Hartmann, and C. Chen, "Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1514-1523, Sep. 1993.
27. L. Ekroot and S. Dolinar, "A* decoding of block codes," IEEE Trans. Commun., vol. 44, no. 9, pp. 1052-1056, Sep. 1996.
28. M. Stojnic, H. Vikalo, and B. Hassibi, "Speeding up the sphere decoder with H∞ and SDP inspired lower bounds," IEEE Trans. Signal Process., vol. 56, no. 2, pp. 712-726, Feb. 2008.
29. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding. New York: Wiley-IEEE Press, 1999.
30. F. Xiong, A. Zerik, and E. Shwedyk, "Sequential sequence estimation for channels with intersymbol interference of finite or infinite length," IEEE Trans. Commun., vol. 38, no. 6, pp. 795-804, Jun. 1990.
31. 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.
32. B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4867-4878, Oct. 2008.
33. T. Cui, T. Ho, and C. Tellambura, "Statistical pruning for near maximum likelihood detection of MIMO systems," in Proc. IEEE Int. Conf. Commun., Jun. 2007, pp. 5462-5467.
34. 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.
35. H. V. Poor, An Introduction to Signal Detection and Estimation, 2nd ed. New York: Springer-Verlag, 1994.
36. S. M. Kay, Fundamentals of statistical signal processing: Estimation theory. Reading, MA: Addison-Wesley/Longman, 1993.
37. M. Tüchler, A. C. Singer, and R. Koetter, "Minimum mean squared error equalization using a priori information," IEEE Trans. Signal Process., vol. 50, no. 3, pp. 673-683, Mar. 2002.
38. D. Milliner, E. Zimmermann, J. R. Barry, and G. Fettweis, "Channel state information based LLR clipping in list MIMO detection," in Proc. IEEE 19th Int. Symp. Personal, Indoor, Mobile Radio Commun., Sep. 2008, pp. 15-18.
39. H. V. Poor and S. Verdu, "Probability of error in MMSE multiuser detection," IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 858-871, May 1997.
40. P. Li, D. Paul, R. Narasimhan, and J. Cioffi, "On the distribution of SINR for the MMSE MIMO receiver and performance analysis," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 271-286, Jan. 2006.
41. D. Guo, S. Verdu, and L. K. Rasmussen, "Asymptotic normality of linear multiuser receiver outputs," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3080-3095, Dec. 2002.
42. J. Proakis, Digital communications, 4th ed. NewYork: McGraw-Hill, 2001.
43. A. M. Tulino and S. Verdu, Random Matrix Theory and Wireless Communications. Foundations and Trends in Communications and Information Theory. Handover, MA: Now Publ., 2004.
44. D. Tse and P.Viswanath, Fundamentals ofWireless Communication. Cambridge, U.K.: Cambridge Univ. Press, 2005.
45. S. T. Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, pp. 806-808, May 1999.
46. K. I. Pedersen, J. B. Andersen, J. P. Kermoa, and P. Mogensen, "A stochastic multiple-input-multiple-output radio channel model for evaluation of space-time coding algorithms," in Proc. IEEE Veh. Technol. Conf., Sep. 2000, pp. 893-897.
47. 2 CMOS soft-input soft-output MIMO detector for IEEE 802.11n," in Proc. IEEE Eur. Solid-State Circuits Conf., Sep. 2010, pp. 530-533.
48. A. Edelman, "Eigenvalues and condition numbers of random matrices," Ph.D. dissertation, Dept. Math., Massachusetts Inst. Technol, Cambridge, MA, 1989.
49. A. Ghosh, R. Ratasuk, B. Mondal, N. Mangalvedhe, and T. Thomas, "LTE-advanced: Next-generation wireless broadband technology," IEEE Trans. Wireless Commun., vol. 17, no. 3, pp. 10-22, Jun. 2010.