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

10 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 Apr 8

Fingerprint

LDPC Codes
Dynamic Scheduling
Belief Propagation
Decoding
Scheduling
Low-density Parity-check (LDPC) Codes
Flooding
Convergence Speed
Update

Keywords

  • Belief propagation decoding
  • LDPC codes
  • Sequential scheduling

ASJC Scopus subject areas

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

Cite this

Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes. / Kim, Saejoon; Ko, Karam; Heo, Jun; Kim, Ji Hwan.

In: IEEE Communications Letters, Vol. 13, No. 3, 08.04.2009, p. 193-195.

Research output: Contribution to journalArticle

@article{00dbe311fb5d4246950650a61a2cb728,
title = "Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes",
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].",
keywords = "Belief propagation decoding, LDPC codes, Sequential scheduling",
author = "Saejoon Kim and Karam Ko and Jun Heo and Kim, {Ji Hwan}",
year = "2009",
month = "4",
day = "8",
doi = "10.1109/LCOMM.2009.081938",
language = "English",
volume = "13",
pages = "193--195",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

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

AU - Kim, Saejoon

AU - Ko, Karam

AU - Heo, Jun

AU - Kim, Ji Hwan

PY - 2009/4/8

Y1 - 2009/4/8

N2 - 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].

AB - 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].

KW - Belief propagation decoding

KW - LDPC codes

KW - Sequential scheduling

UR - http://www.scopus.com/inward/record.url?scp=63649096069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63649096069&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2009.081938

DO - 10.1109/LCOMM.2009.081938

M3 - Article

AN - SCOPUS:63649096069

VL - 13

SP - 193

EP - 195

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

ER -