Adaptive decoding algorithms for low-density parity-check codes over the binary erasure channel

Gou Hosoya, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.

Original languageEnglish
Pages (from-to)2418-2430
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE92-A
Issue number10
DOIs
Publication statusPublished - 2009 Jan 1
Externally publishedYes

Fingerprint

Low-density Parity-check (LDPC) Codes
Decoding
Binary
Belief Propagation
Terminate
Continue

Keywords

  • Belief-propagation decoding
  • Binary erasure channel
  • Low-density parity-check code
  • Stopping set

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Adaptive decoding algorithms for low-density parity-check codes over the binary erasure channel. / Hosoya, Gou; Yagi, Hideki; Kobayashi, Manabu; Hirasawa, Shigeichi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E92-A, No. 10, 01.01.2009, p. 2418-2430.

Research output: Contribution to journalArticle

@article{8bffab4b68a948aabe9f06de36b69520,
title = "Adaptive decoding algorithms for low-density parity-check codes over the binary erasure channel",
abstract = "Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.",
keywords = "Belief-propagation decoding, Binary erasure channel, Low-density parity-check code, Stopping set",
author = "Gou Hosoya and Hideki Yagi and Manabu Kobayashi and Shigeichi Hirasawa",
year = "2009",
month = "1",
day = "1",
doi = "10.1587/transfun.E92.A.2418",
language = "English",
volume = "E92-A",
pages = "2418--2430",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - Adaptive decoding algorithms for low-density parity-check codes over the binary erasure channel

AU - Hosoya, Gou

AU - Yagi, Hideki

AU - Kobayashi, Manabu

AU - Hirasawa, Shigeichi

PY - 2009/1/1

Y1 - 2009/1/1

N2 - Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.

AB - Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.

KW - Belief-propagation decoding

KW - Binary erasure channel

KW - Low-density parity-check code

KW - Stopping set

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

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

U2 - 10.1587/transfun.E92.A.2418

DO - 10.1587/transfun.E92.A.2418

M3 - Article

AN - SCOPUS:78651340321

VL - E92-A

SP - 2418

EP - 2430

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 10

ER -