Sequential message-passing decoding of LDPC codes by partitioning check nodes

Sunghwan Kim, Min Ho Jang, Jong Seon No, Song Nam Hong, Dong Joon Shin

Research output: Contribution to journalArticle

6 Scopus citations


In this paper, we analyze the sequential messagepassing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.

Original languageEnglish
Pages (from-to)1025-1031
Number of pages7
JournalIEEE Transactions on Communications
Issue number7
Publication statusPublished - 2008 Jul 1



  • Density evolution
  • Flooding schedule
  • Low-density parity-check (LDPC) codes
  • Message-passing decoding
  • Sequential decoding

Cite this