Complexity Limited Sphere Decoder and Its SER Performance Analysis 


Vol. 33,  No. 6, pp. 577-582, Jun.  2008


PDF Full-Text
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

E. S. Jeon, J. H. Yang, D. K. Kim, "Complexity Limited Sphere Decoder and Its SER Performance Analysis," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 6, pp. 577-582, 2008. DOI: .

[ACM Style]

Eun Sung Jeon, Jang Hoon Yang, and Dong Ku Kim. 2008. Complexity Limited Sphere Decoder and Its SER Performance Analysis. The Journal of Korean Institute of Communications and Information Sciences, 33, 6, (2008), 577-582. DOI: .

[KICS Style]

Eun Sung Jeon, Jang Hoon Yang, Dong Ku Kim, "Complexity Limited Sphere Decoder and Its SER Performance Analysis," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 6, pp. 577-582, 6. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880