New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 


Vol. 31,  No. 4, pp. 310-317, Apr.  2006


PDF
  Abstract

In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm[3],[7], especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.

  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]

S. Kim, M. Jang, J. No, S. Hong, D. Shin, "New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 310-317, 2006. DOI: .

[ACM Style]

Sunghwan Kim, Min-Ho Jang, Jong-Seon No, Song-Nam Hong, and Dong-Joon Shin. 2006. New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes. The Journal of Korean Institute of Communications and Information Sciences, 31, 4, (2006), 310-317. DOI: .

[KICS Style]

Sunghwan Kim, Min-Ho Jang, Jong-Seon No, Song-Nam Hong, Dong-Joon Shin, "New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 310-317, 4. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880