An Iterative Decoding for LDPC Codes using Approximated Check Node Function 


Vol. 33,  No. 12, pp. 479-484, Dec.  2008


PDF Full-Text
  Abstract

In order to reduce the decoding complexity of low density parity-check(LDPC) codes, some fast algorithms called suboptimal decoding, such as min-sum algorithm, normalized min-sum algorithm, were proposed. However, there would be approximation inaccuracy between the sum-product algorithm and the min-sum algorithm, which incurs some degradation in decoding performance. In this paper, an efficient iterative decoding algorithm using approximated check-node function is proposed to improve the approximation inaccuracy. Simulation results show that the proposed algorithm achieves a performance very close to that of the SPA algorithm while preserving the 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.


  Cite this article

[IEEE Style]

H. Cheong and S. Kim, "An Iterative Decoding for LDPC Codes using Approximated Check Node Function," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 479-484, 2008. DOI: .

[ACM Style]

Ho-Young Cheong and Sin-Ryeong Kim. 2008. An Iterative Decoding for LDPC Codes using Approximated Check Node Function. The Journal of Korean Institute of Communications and Information Sciences, 33, 12, (2008), 479-484. DOI: .

[KICS Style]

Ho-Young Cheong and Sin-Ryeong Kim, "An Iterative Decoding for LDPC Codes using Approximated Check Node Function," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 479-484, 12. 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