Low Complexity Hybrid Decoding Scheme for Polar Codes. 


Vol. 48,  No. 6, pp. 623-629, Jun.  2023
10.7840/kics.2023.48.6.623


PDF
  Abstract

Successive Cancellation List (SCL) decoding algorithm for polar codes offers a better performance in terms of bit error rate (BER) compared to SC (successive cancellation) decoding algorithm at the expense of high complexity. On the other hand, bit channels late in order to decode have relatively high reliability in general. Based on this observation, we propose a low complexity hybrid decoding scheme for polar codes. In the proposed scheme, SCL decoding is performed up to a predetermined bit channel and then, the remaining bit channels are decoded with SC decoding. The proposed decoding scheme offers a virtually identical BER performances to that of SCL with relatively low decoding complexity.

  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.


  Related Articles
  Cite this article

[IEEE Style]

S. Choi, C. Lee, C. Park, W. Oh, "Low Complexity Hybrid Decoding Scheme for Polar Codes.," The Journal of Korean Institute of Communications and Information Sciences, vol. 48, no. 6, pp. 623-629, 2023. DOI: 10.7840/kics.2023.48.6.623.

[ACM Style]

Suyong Choi, Chungsoo Lee, Chansoo Park, and Wangrok Oh. 2023. Low Complexity Hybrid Decoding Scheme for Polar Codes.. The Journal of Korean Institute of Communications and Information Sciences, 48, 6, (2023), 623-629. DOI: 10.7840/kics.2023.48.6.623.

[KICS Style]

Suyong Choi, Chungsoo Lee, Chansoo Park, Wangrok Oh, "Low Complexity Hybrid Decoding Scheme for Polar Codes.," The Journal of Korean Institute of Communications and Information Sciences, vol. 48, no. 6, pp. 623-629, 6. 2023. (https://doi.org/10.7840/kics.2023.48.6.623)
Vol. 48, No. 6 Index

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880