Bootstrapped modified weighted bit flipping decoding of low density parity check codes

Yoichi Inaba, Tomoaki Ohtsuki

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

Original languageEnglish
Pages (from-to)1145-1149
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE89-A
Issue number4
DOIs
Publication statusPublished - 2006 Apr

Fingerprint

Low-density Parity-check (LDPC) Codes
Decoding
Bootstrap
Error Rate
Lowest

Keywords

  • Bootstrap decoding
  • Low density parity check codes
  • Modified WBF algorithm
  • WBF algorithm

ASJC Scopus subject areas

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

Cite this

@article{8e5f85c997e040eda4909ef089f5c7f6,
title = "Bootstrapped modified weighted bit flipping decoding of low density parity check codes",
abstract = "Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.",
keywords = "Bootstrap decoding, Low density parity check codes, Modified WBF algorithm, WBF algorithm",
author = "Yoichi Inaba and Tomoaki Ohtsuki",
year = "2006",
month = "4",
doi = "10.1093/ietfec/e89-a.4.1145",
language = "English",
volume = "E89-A",
pages = "1145--1149",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

TY - JOUR

T1 - Bootstrapped modified weighted bit flipping decoding of low density parity check codes

AU - Inaba, Yoichi

AU - Ohtsuki, Tomoaki

PY - 2006/4

Y1 - 2006/4

N2 - Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

AB - Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

KW - Bootstrap decoding

KW - Low density parity check codes

KW - Modified WBF algorithm

KW - WBF algorithm

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

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

U2 - 10.1093/ietfec/e89-a.4.1145

DO - 10.1093/ietfec/e89-a.4.1145

M3 - Article

AN - SCOPUS:33646230767

VL - E89-A

SP - 1145

EP - 1149

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

ER -