Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes

Saejoon Kim, Karam Ko, Jun Heo, Ji Hwan Kim

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


Recent studies have shown that sequential belief propagation decoding of low-density parity-check codes can increase the decoding convergence speed while simultaneously improving the asymptotic performance compared to the conventional flooding scheme. Two of the practical sequential decoding schemes known are the ones by Casado et al. [1] in which informed dynamic scheduling is used for scheduling the sequential updates of the messages. In this letter, we propose a two-staged informed dynamic scheduling that unifies and outperforms the two schemes of [1].

Original languageEnglish
Pages (from-to)193-195
Number of pages3
JournalIEEE Communications Letters
Issue number3
Publication statusPublished - 2009

Bibliographical note

Funding Information:
The work of S. Kim was supported by the Special Research Grant of Sogang University 200811028.01. The work of J. Heo was supported by the IT R&D program of MKE/IITA [2008-F-006-01, Wireless Local Area Communication Systems on Tera Hertz Band]. The work of J.-H. Kim was supported by the Sogang University Research Grant of 200701117.01. Digital Object Identifier 10.1109/LCOMM.2009.081938


  • Belief propagation decoding
  • LDPC codes
  • Sequential scheduling

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes'. Together they form a unique fingerprint.

Cite this