Soft-input soft-output list sphere detection with a probabilistic radius tightening

IEEE Transactions on Wireless Communications

Volumn 11, Issue 8, 2012, Pages 2848-2857

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

^a Korea University   (South Korea)

^b QUALCOMM INC   (United States)

Author keywords

a posteriori probability; complexity reduction; Iterative detection and decoding; multiple input multiple output system; probabilistic radius tightening; Sphere decoding

Indexed keywords

A-POSTERIORI PROBABILITIES; COMPLEXITY REDUCTION; ITERATIVE DETECTION AND DECODING; MULTIPLE INPUT MULTIPLE OUTPUT SYSTEM; SPHERE DECODING;

FORESTRY; MIMO SYSTEMS;

DECODING;

DETECTION; FORESTRY; SIMULATION; SPHERES;

EID: 84865398040     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2012.060212.111311     Document Type: Article

References (30)

1. J. Lee, B. Shim, and I. Kang "List sphere decoding with a probabilistic radius tightening," 2010 IEEE GLOBECOM.
2. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
3. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, pp. 429-445, Mar. 1996. (Pubitemid 126770498)
4. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Computat., vol. 44, pp. 463-471, Apr. 1985.
5. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, pp. 1639-1642, July 1999.
6. 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.
7. H. Vikalo, B. Hassibi, and T. Kailath, "Iterative decoding for MIMO channels via modified sphere decoding," IEEE Trans. Wireless Commun., vol. 3, pp. 2299-2311, Nov. 2004. (Pubitemid 40088630)
8. R. Wang and G. B. Giannakis, "Approaching MIMO channel capacity with soft detection based on hard sphere decoding," IEEE Trans. Commun., vol. 54, pp. 587-590, Apr. 2006.
9. C. Studer, A. Burg, and H. B̈olcskei, "Soft-input soft-output single treesearch sphere decoding," IEEE Trans. Inf. Theory, vol. 56, pp. 4827-4842, Oct. 2010 (see also http://www. ece. rice. edu/∼cs32/index. html).
10. J. Boutros, N. Gresset, L. Brunel, and M. Fossorier, "Soft-input softoutput lattice sphere decoder for linear channels," 2003 IEEE GLOBECOM.
11. Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE J. Sel. Areas Commun., vol. 24, pp. 491-503, Mar. 2006.
12. Yvo L. C. de Jong and T. J. Willink, "Iterative tree search detection for MIMO wireless systems," IEEE Trans. Commun., vol. 53, pp. 930-935, June 2005. (Pubitemid 40970297)
13. J. B. Anderson and S. Mohan, "Sequential coding algorithms: a survey and cost analysis," IEEE Trans. Commun., vol. COM-32, pp. 169-176, Feb. 1984. (Pubitemid 14547954)
14. L. G. Overlinebero, T. Ratnarajah, and C. Cowan, "A low-complexity soft-MIMO detector based on the fixed-complexity sphere decoder," IEEE Acoustic, Speech and Signal Process., pp. 2669-2672, Apr. 2008.
15. E. G. Larsson and J. Jald́en, "Fixed-complexity soft MIMO detection via partial marginalization," IEEE Trans. Signal Process., vol. 56, pp. 3397-3407, Aug. 2008.
16. B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol. 56, pp. 4867-4878, Oct. 2008.
17. J. Clausen, Branch and Bound Algorithms: Principles and Examples. Dept. Comput. Sci., Univ. Copenhagen. Available: http://www. imm. dtu. dk/jha/.
18. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm-I: expected complexity," IEEE Trans. Signal Process., vol. 53, pp. 2806-2818, Aug. 2005.
19. S. M. Ross, Probability Models. Academic Press, 2000.
20. P. B. Patnaik, "The noncentral χ2 and F-distributions and their applications," Biometrika, vol. 36, pp. 202-232, 1949.
21. B. Shim and I. Kang, "On further reduction of complexity in tree pruning based sphere search," IEEE Trans. Commun., vol. 58, pp. 417-422, Feb. 2010.
22. S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, pp. 806-808, May 1999.
23. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol. 55, pp. 2661-2675, June 2007. (Pubitemid 46851632)
24. S. Schwandter, P. Fertl, C. Novak, and G. Matz, "Log-likelihood ratio clipping in MIMO-BICM systems: information geometric analysis and impact on system capacity," Proc. 2003 ICASSP.
25. C. Studer, S. Fateh, and D. Seethaler, "ASIC implementation of softinput soft-output MIMO detection using parallel interference cancellation," IEEE J. Solid-State Circuits, vol. 46, pp. 1754-1765, July 2011.
26. D. Ẅubben, R. B̈ohnke, J. Rinnas, V. K̈uhn, and K. D. Kammeyer, "Efficient algorithm for decoding layered space-time codes," Electron. Lett., vol. 37, pp. 1348-1350, Oct. 2001. (Pubitemid 33025625)
27. D. Ẅubben, R. B̈ohnke, J. Rinnas, V. K̈uhn, and K. D. Kammeyer, "MMSE extension of V-BLAST based on sorted QR decomposition," in Proc. 2003 IEEE Vehic. Tech. Conf., vol. 1, pp. 508-512.
28. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, pp. 1727-1737, Oct. 2001.
29. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, pp. 619-637, Feb. 2001. (Pubitemid 32318093)
30. M. T̈uchler, "Design of serially concatenated systems depending on the block length," IEEE Trans. Commun., vol. 52, pp. 209-218, Feb. 2004.