Browse > Article
http://dx.doi.org/10.5909/JBE.2010.15.6.742

Radius Optimization for Efficient List Sphere Decoding  

Lee, Jae-Seok (School of Information and Communication, Korea University)
Lee, Byung-Ju (School of Information and Communication, Korea University)
Shim, Byong-Hyo (School of Information and Communication, Korea University)
Publication Information
Journal of Broadcast Engineering / v.15, no.6, 2010 , pp. 742-748 More about this Journal
Abstract
Instead of using sphere decoding, list sphere decoding (LSD) has been introduced to increase the reliability of log-likelihood ratio (LLR) in recent soft decoding schemes employing iterative detection and decoding (IDD). Although LSD provides improved performance, it does not obtain complexity gain due to signal-to-noise ratio (SNR) increment as it detects large number of lattice points. Especially, its inefficient scenario arises when it has to search for lattice points which have small affect for obtaining LLR with high reliability. In this paper, we study an efficient algorithm to remove such lattice points, which results in complexity reduction based on radius optimization.
Keywords
Complexity reduction; list sphere decoding; radius optimization; iterative detection and decoding; MIMO system;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. B. Patnaik, "The noncentral A2 and F-distributions and their applications," Biometrika, vol. 36, pp. 202-232, 1949.
2 R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol. 55, pp. 2661-2675, June 2007.   DOI   ScienceOn
3 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.   DOI   ScienceOn
4 C. Studer, A. Burg and H. BAolcskei, "Soft-output sphere decoding: algorithms and VLSI implementation," IEEE Journal on Selected Areas in Commun., vol. 26, pp. 290-300, Feb. 2008.   DOI   ScienceOn
5 B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol. 56, pp. 4867-4878, Oct. 2008.   DOI   ScienceOn
6 A. M. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," in IEEE Int. Conf. Communications (ICC) New York, vol. 1, pp. 460-464, 2002
7 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.   DOI   ScienceOn
8 L. Babai, "On Lov'asz' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, pp. 1-13, 1986.   DOI
9 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.   DOI   ScienceOn
10 E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.   DOI   ScienceOn