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 journalArticle

11 Citations (Scopus)

Abstract

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
Volume13
Issue number3
DOIs
Publication statusPublished - 2009

Keywords

  • Belief propagation decoding
  • LDPC codes
  • Sequential scheduling

ASJC Scopus subject areas

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

Fingerprint 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