Best Papers
 Low Complexity Early Termination Detector for Polar Code Belief Propagation Decoding 


Vol. 49,  No. 3, pp. 435-443, Mar.  2024
10.7840/kics.2024.49.3.435


PDF Full-Text
  Abstract

Belief propagation (BP) decoding algorithm was proposed as a low latency decoding algorithm for polar codes. Unfortunately it requires relatively high decoding complexity compared to successive cancellation decoding. To remedy high complexity problem, early termination BP algorithm was proposed which requires additional complexity for stopping criteria test. In this paper, we propose low-complexity early termination detectors based on the characteristics of log-likelihood ratios generated within BP detectors. The proposed detectors offer identical performance with lower complexity compared to conventional detectors.

  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]

C. Lee, S. Back, C. Park, W. Oh, "Low Complexity Early Termination Detector for Polar Code Belief Propagation Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 49, no. 3, pp. 435-443, 2024. DOI: 10.7840/kics.2024.49.3.435.

[ACM Style]

Chungsu Lee, Sungyeol Back, Chansoo Park, and Wangrok Oh. 2024. Low Complexity Early Termination Detector for Polar Code Belief Propagation Decoding. The Journal of Korean Institute of Communications and Information Sciences, 49, 3, (2024), 435-443. DOI: 10.7840/kics.2024.49.3.435.

[KICS Style]

Chungsu Lee, Sungyeol Back, Chansoo Park, Wangrok Oh, "Low Complexity Early Termination Detector for Polar Code Belief Propagation Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 49, no. 3, pp. 435-443, 3. 2024. (https://doi.org/10.7840/kics.2024.49.3.435)
Vol. 49, No. 3 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