Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder 


Vol. 32,  No. 9, pp. 888-894, Sep.  2007


PDF Full-Text
  Abstract

The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type Ⅰ). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type Ⅱ). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type Ⅰ and Type Ⅱ sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type Ⅰ and Type Ⅱ provide an additional 10-15% complexity reduction while maintaining detection performance.

  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, Y. H. Kim, D. K. Kim, "Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 9, pp. 888-894, 2007. DOI: .

[ACM Style]

Eun Sung Jeon, Yo Han Kim, and Dong Ku Kim. 2007. Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder. The Journal of Korean Institute of Communications and Information Sciences, 32, 9, (2007), 888-894. DOI: .

[KICS Style]

Eun Sung Jeon, Yo Han Kim, Dong Ku Kim, "Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 9, pp. 888-894, 9. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880