Browse > Article

Complexity Limited Sphere Decoder and Its SER Performance Analysis  

Jeon, Eun-Sung (연세대학교 전기전자공학과 이동통신 연구실)
Yang, Jang-Hoon (연세대학교 전기전자공학과 이동통신 연구실)
Kim, Bong-Ku (연세대학교 전기전자공학과 이동통신 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.6A, 2008 , pp. 577-582 More about this Journal
Abstract
In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited nodes reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited nodes running from the most upper layer. The second one contains corresponding demodulated outputs of ZF receiver. Between these two candidate symbol vectors, the one with smaller euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.
Keywords
Sphere decoder(SD); Zero-forcing(ZF);
Citations & Related Records
연도 인용수 순위
  • Reference
1 C.P. Schnorr and M. Eucherr, 'Lattice basis reduction: improved practical algorithms and solving subset sum problems,' Mathematical Programming, vol 66, pp.181-191,1994   DOI
2 D.wubben, R.Bohnke, J. Einas, V. Kuhn and K.D. Kammeyer,'Efficient Algorithm for decoding Layered Space-time Codes,' IEE Electronics Letters, Vol.37, pp.1348-1540, October 2001   DOI   ScienceOn
3 E. Viterbo and J. Boutros, 'A universal lattice code decoder for fading channels,' IEEE Trans. Inf. Theory, Vol.45, No.5 pp.1639-1642, July 1999   DOI   ScienceOn
4 M.O. Damen, H. EI Gamal and G. Caire, 'On maximum-likelihood detection and the search for the closest lattice point', IEEE Trans. Info. Thoery, Vol.49,pp.2389-2402, Oct. 2003   DOI   ScienceOn
5 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   DOI
6 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   DOI   ScienceOn
7 Kai-Kit Wong, Paulraj. A, 'On the decoding order of MIMO maximum likelihood sphere decoder: Linear and non-linear receivers', in Proc. VTC, Vol.2, pp.698-702., May. 2004
8 A. Chan and I. LEE, 'A new reduced-complexity sphere decoding for multiple antenna systems,' in Proc. ICC, Vol.1., pp.460-464.,New York, Apr.28-May 2 2002