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

IEEE International Conference on Electronics, Communications and Intelligent Science (ECIS)

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

Haobin Xu, Zhongfeng Wang, Suwen Song

Published May 22, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ecis69634.2026.11604348

Related papers

Improved Weighted Bit Flip Voting decoding algorithm for generalized LDPC

Yibin Yang, Jintao Li, Hui Ling Yu +1 more

A generalized low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with a small linear block code referred to as the constituent code other than single parity checks. For the optical system or ultra-high speed wireless data transfer system, it is hard to gain soft LLRs which need to be supplied by ultra-high speed A/D converters, so the hard decision decoder is important for these systems. Similar with Gallager's bit-flipping algorithm for LDPC, the Weighted Bit Flip Voting (WBFV) algorithm has been proposed to decode GLDPC with only the hard decision which proved to be good performance. But the finding of max vote in the algorithm is intractability for the hardware implementation. If we find the max from thousands of data (code length is usually thousands) serially, thousands of cycles needed result to large latency; a lot of compare modules needed for parallel finding of the max, result to large resource. In this paper, we proposed an improved and simplified WBFV algorithm which without max voting finding is easy for hardware implementation. The proposed improved algorithm not only has no performance loss, but also speeds up the iteration convergence. Then we proposed a full parallel GLDPC decoder design for our algorithm with very low complexity.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2012•0 citations

Decoding of generalised low-density parity-check codes using weighted bit-flip voting

S. Hirst, B. Honary

A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. Performance is found to compete well with other more conventional hard decision decoding schemes.

IEE Proceedings - Communications•Jan 1, 2002•19 citations

Symbol-flipping based decoding of generalized low-density parity-check codes over GF(q)

Fang-Chun Kuo, L. Hanzo

An efficient symbol-flipping based decoding algorithm designed for nonbinary generalized low-density parity-check (GLDPC) codes is proposed. By extending the concept of the weighted bit flip voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (R-S) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively

IEEE Wireless Communications and Networking Conference•Jan 1, 2006•10 citations

Information Storage Bit-Flipping Decoder for LDPC Codes

Hangxuan Cui, Jun Ting Lin, Zhongfeng Wang

Tabu-list random-penalty gradient descent bit-flipping (TRGDBF) decoder is the state-of-the-art hard-decision low-density parity-check (LDPC) decoder in terms of error-correction performance on binary symmetric channel (BSC). However, the TRGDBF decoder suffers from a long critical path caused by the global maximum-finding operation, limiting the achievable throughput. This brief proposes an information storage bit-flipping (ISBF) decoder to solve this problem. Different from the existing bit-flipping (BF) decoders which adopt serial decoding manner, in the ISBF decoder, by storing the previous decoding information, the global maximum-finding operation can be executed in parallel to other decoding operations, significantly shortening the critical path. Moreover, a nonuniform flipping rule is incorporated to achieve a better decoding performance. We also present an efficient architecture to implement the ISBF decoder. The design example demonstrates that compared to other hard-decision BF decoders, the ISBF decoder could provide both the best decoding performance and throughput on BSC.

IEEE Transactions on Very Large Scale Integration (VLSI) Systems•Sep 17, 2020•19 citations

Layered Bit-Flipping Algorithms for Decoding LDPC Codes

Fangxia Luo, Xuan He, Jiongyue Xing +1 more

At present, various communication and storage systems have put forward high requirements on both the complexity and performance of low-density parity-check (LDPC) decoders. Bit flipping decoders are a good candidate for these applications. This letter proposes to utilize the column layered scheduling to speed up the convergence and improve the error correcting performance of existing bit flipping algorithms. As the information storage bit flipping (ISBF) algorithm generally performs the best, we investigate the layered ISBF (LISBF) algorithm in detail, including developing two efficient techniques for optimizing the computation of flipping thresholds: forward-backward computation and two-max computation. Simulation results on a (3, 6) LDPC code show that, compared to the ISBF algorithm, the LISBF algorithm can reduce the frame error rate by up to an order and reduce the average number of iterations by around 40%.

International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)•Apr 22, 2022•3 citations

Multiple Flipping Strategy LISBF for LDPC Codes

Yishan Sun, Pingyang Huang, Yichun Zhang +1 more

The performance and complexity of low-density parity-check (LDPC) decoders have strict requirements since they are widely demanded in both communication and storage systems. Information storage bit flipping (ISBF) decoder and layered ISBF (LISBF) decoder demonstrate excellent decoding performance and throughput in which the global maximumfinding operation can be calculated in parallel to other decoding operations. However, their error-correction performance is not satisfactory. In this paper, we consider a variety of optimizations based on LISBF and propose a new algorithm named multiple flipping strategy LISBF (MLISBF). First, a high probability is adopted to flip those bits with high energy values. Second, strict flipping with a lower threshold is triggered when the syndrome weight is negligible. Then, we introduce perturbation flipping at specific iterations to help the decoder overcome trapping sets. We designed an efficient hardware implementation which realizes the layered calculation for BF decoders and reduces hardware resources for the MLISBF algorithm.

World Conference on Computing and Communication Technologies (WCCCT)•Jan 6, 2023•1 citation
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.
A generalized low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with a small linear block code referred to as the constituent code other than single parity checks. For the optical system or ultra-high speed wireless data transfer system, it is hard to gain soft LLRs which need to be supplied by ultra-high speed A/D converters, so the hard decision decoder is important for these systems. Similar with Gallager's bit-flipping algorithm for LDPC, the Weighted Bit Flip Voting (WBFV) algorithm has been proposed to decode GLDPC with only the hard decision which proved to be good performance. But the finding of max vote in the algorithm is intractability for the hardware implementation. If we find the max from thousands of data (code length is usually thousands) serially, thousands of cycles needed result to large latency; a lot of compare modules needed for parallel finding of the max, result to large resource. In this paper, we proposed an improved and simplified WBFV algorithm which without max voting finding is easy for hardware implementation. The proposed improved algorithm not only has no performance loss, but also speeds up the iteration convergence. Then we proposed a full parallel GLDPC decoder design for our algorithm with very low complexity.
A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. Performance is found to compete well with other more conventional hard decision decoding schemes.
An efficient symbol-flipping based decoding algorithm designed for nonbinary generalized low-density parity-check (GLDPC) codes is proposed. By extending the concept of the weighted bit flip voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (R-S) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively
Tabu-list random-penalty gradient descent bit-flipping (TRGDBF) decoder is the state-of-the-art hard-decision low-density parity-check (LDPC) decoder in terms of error-correction performance on binary symmetric channel (BSC). However, the TRGDBF decoder suffers from a long critical path caused by the global maximum-finding operation, limiting the achievable throughput. This brief proposes an information storage bit-flipping (ISBF) decoder to solve this problem. Different from the existing bit-flipping (BF) decoders which adopt serial decoding manner, in the ISBF decoder, by storing the previous decoding information, the global maximum-finding operation can be executed in parallel to other decoding operations, significantly shortening the critical path. Moreover, a nonuniform flipping rule is incorporated to achieve a better decoding performance. We also present an efficient architecture to implement the ISBF decoder. The design example demonstrates that compared to other hard-decision BF decoders, the ISBF decoder could provide both the best decoding performance and throughput on BSC.
At present, various communication and storage systems have put forward high requirements on both the complexity and performance of low-density parity-check (LDPC) decoders. Bit flipping decoders are a good candidate for these applications. This letter proposes to utilize the column layered scheduling to speed up the convergence and improve the error correcting performance of existing bit flipping algorithms. As the information storage bit flipping (ISBF) algorithm generally performs the best, we investigate the layered ISBF (LISBF) algorithm in detail, including developing two efficient techniques for optimizing the computation of flipping thresholds: forward-backward computation and two-max computation. Simulation results on a (3, 6) LDPC code show that, compared to the ISBF algorithm, the LISBF algorithm can reduce the frame error rate by up to an order and reduce the average number of iterations by around 40%.
The performance and complexity of low-density parity-check (LDPC) decoders have strict requirements since they are widely demanded in both communication and storage systems. Information storage bit flipping (ISBF) decoder and layered ISBF (LISBF) decoder demonstrate excellent decoding performance and throughput in which the global maximumfinding operation can be calculated in parallel to other decoding operations. However, their error-correction performance is not satisfactory. In this paper, we consider a variety of optimizations based on LISBF and propose a new algorithm named multiple flipping strategy LISBF (MLISBF). First, a high probability is adopted to flip those bits with high energy values. Second, strict flipping with a lower threshold is triggered when the syndrome weight is negligible. Then, we introduce perturbation flipping at specific iterations to help the decoder overcome trapping sets. We designed an efficient hardware implementation which realizes the layered calculation for BF decoders and reduces hardware resources for the MLISBF algorithm.