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

Yoichi Inaba, Tomoaki Ohtsukti

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

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
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Bootstrapped modified weighted bit flipping decoding of low density parity check codes'. Together they form a unique fingerprint.

  • Cite this