Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Digital Signal Processing

Hybrid weighted bit flipping low density parity check decoding

Honey Durga Tiwari, Harsh Durga Tiwari, Kang‐Yoon Lee

Published Feb 5, 2014• 5 citations
Publisher
DOI
10.1016/j.dsp.2014.01.011

Related papers

One Hybrid-Parallel Weighted Bit-Flipping Algorithm for Low-Density Parity-Check Codes

Zhongxun Wang, Fangqiang Zhu

Lecture notes in electrical engineering•Jan 1, 2012•0 citations

Modified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes

Guangwen Li, Guangzeng Feng

•Jan 8, 2008•0 citations

An Efficient Decoding Algorithm for Finite-Geometry Low-Density Parity-Check Codes

Quan Zi-yi

Based on decoding performance,complexity and latency of finite-geometry low-density parity-check(FG-LDPC) codes,an efficient decoding algorithm is proposed.The new algorithm is a hybrid bit-flipping(BF)/majority-logic(MLG) decoding scheme.In BF decoding,an efficient method was explored to measure the reliability of the checks.At the completion of a small number of iterations,the output from BF decoding is decoded by MLG decoding.In the hybrid algorithm,there are no float operations.Simulation results show that the hybrid algorithm can provide 0.3?dB coding gain over weight bit-flipping(WBF) decoding.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 citations

The Weighted Information Storage Bit-Flipping Decoder for Generalized LDPC Codes

Haobin Xu, Zhongfeng Wang, Suwen Song

By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC $90-\mathrm{nm}$ technology, the proposed GLDPC WISBF decoder achieves $\mathbf{1 1 4. 3 \%}$ higher throughput than the GLDPC WBFV decoder.

IEEE International Conference on Electronics, Communications and Intelligent Science (ECIS)•May 22, 2026•0 citations

Self reliability based weighted bit-flipping decoding for low-density parity-check codes

Jin Sha, Minglun Gao, Zhongjin Zhang +2 more

Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

International Conference on Instrumentation, Measurement, Circuits and Systems•Apr 16, 2006•3 citations

Hybrid (Multistage) Decoding of Low-density Parity-check Codes

Amir H. Banihashemi, A. Nouh, Pirouz Zarrinkhat

•Oct 2, 2002•0 citations
Based on decoding performance,complexity and latency of finite-geometry low-density parity-check(FG-LDPC) codes,an efficient decoding algorithm is proposed.The new algorithm is a hybrid bit-flipping(BF)/majority-logic(MLG) decoding scheme.In BF decoding,an efficient method was explored to measure the reliability of the checks.At the completion of a small number of iterations,the output from BF decoding is decoded by MLG decoding.In the hybrid algorithm,there are no float operations.Simulation results show that the hybrid algorithm can provide 0.3?dB coding gain over weight bit-flipping(WBF) decoding.
By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC 90−nm90-\mathrm{nm}90−nm technology, the proposed GLDPC WISBF decoder achieves 114.3%\mathbf{1 1 4. 3 \%}114.3% higher throughput than the GLDPC WBFV decoder.
Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability