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

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

doi:10.1109/LCOMM.2009.081938

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 journal › Article › peer-review

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 language	English
Pages (from-to)	193-195
Number of pages	3
Journal	IEEE Communications Letters
Volume	13
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2009.081938
Publication status	Published - 2009

Keywords

Belief propagation decoding
LDPC codes
Sequential scheduling

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2009.081938

Cite this

@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}",

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",

year = "2009",

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

N1 - 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

PY - 2009

Y1 - 2009

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

U2 - 10.1109/LCOMM.2009.081938

DO - 10.1109/LCOMM.2009.081938

M3 - Article

AN - SCOPUS:63649096069

SN - 1089-7798

VL - 13

SP - 193

EP - 195

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this