List sphere decoding with a probabilistic radius tightening

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2010, Pages

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

^a Korea University   (South Korea)

^b QUALCOMM INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-POSTERIORI PROBABILITIES; FIXED NUMBERS; ITERATIVE DETECTION AND DECODING; LATTICE POINTS; LIST SPHERE DECODING; LOWER COMPLEXITY; NEAR-OPTIMAL; PROBABILISTIC TREES; PROBABILISTICS; SEARCH ALGORITHMS;

ITERATIVE DECODING;

EID: 79551645751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2010.5684113     Document Type: Conference Paper

References (15)

1. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, March 2003.
2. J. Hagenauer, E. Offer and L. Papke, "Iterative decoding of binary and block convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, March 1996.
3. 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, April 2006.
4. Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE Journal of selected areas in Comm., vol. 24, pp. 491-503, March 2006.
5. 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.
6. 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.
7. J. Jalden and B. Ottersten, "Parallel implementation of a soft output sphere decoder," Asilomar Conference on Signals, Systems, and Computers., pp. 581-585, Nov. 2005.
8. B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol. 56, pp. 4867-4878, Oct. 2008.
9. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
10. J. Clausen,"Branch and Bound Algorithms. Principles and Examples," Dept. Comput. Sci., Univ. Copenhagen, [Online]. Available: http://www.imm.dtu.dk/jha/.
11. S. M. Ross, Probability Models, Academic Press, 2000.
12. H. Harmut F. W. and H. Margret H., Computing with mathematica, Academic Press, 1998.
13. P. B. Patnaik, "The noncentral .2 and F-distributions and their applications," Biometrika, vol. 36, pp. 202-232, 1949.
14. L. Babai, "On Lov asz' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, pp. 1-13, 1986.
15. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol. 55, pp. 2661-2675, June 2007.