© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

World Conference on Computing and Communication Technologies (WCCCT)

Multiple Flipping Strategy LISBF for LDPC Codes

Yishan Sun, Pingyang Huang, Yichun Zhang, Zhiyuan Cheng

Published Jan 6, 2023• 1 citation

Abstract

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.

DOI: 10.1109/wccct56755.2023.10052347

Related papers

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

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•18 citations

Modified Bit-Flipping Decoding of Low-Density Parity-Check Codes

Yuan Hua Liu, Mei Ling Zhang

A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.

Advanced materials research•Jun 1, 2013•0 citations

Multi-Threshold Bit Flipping Algorithm for Decoding Structured LDPC Codes

Yuanhua Liu, Xinliang Niu, Meiling Zhang

A novel bit-flipping (BF) decoding algorithm is proposed for structured low-density parity-check (LDPC) codes. The proposed BF algorithm which is called multi-threshold bit-flipping (MTBF) algorithm, flips multiple bits by using multiple thresholds at each iteration. It only requires some real operations before iterations and requires only logical operations during the iterations. The MTBF algorithm has lower complexity than the weighted bit-flipping algorithm and its modifications. Simulations show that the proposed algorithm has fast convergence speed and good performance.

IEEE Communications Letters•Nov 24, 2014•22 citations

Improved Bit-Flipping Method for Decoding Structured Low-Density Parity-Check Codes

Meiling Zhang

An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.

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

Adaptive Threshold Technique for Bit-Flipping Decoding of Low-Density Parity-Check Codes

Junho Cho, Wonyong Sung

The bit-flipping (BF) algorithm for decoding of low-density parity-check (LDPC) codes requires less complex hardware than other decoding algorithms, but its error correcting performance needs to be improved. In this letter, a threshold adaptation scheme is applied to BF algorithm based decoding of LDPC codes. Our experiments show that the optimal threshold value for BF depends on the error conditions, and threshold adjustment during decoding helps to prevent meaningless no-flipping iterations. Based on these statistical observations, the adaptive threshold technique is proposed to pursue both the maximum error correcting capability and the fastest decoding convergence.

IEEE Communications Letters•Aug 5, 2010•32 citations

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.

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%.

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.

A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.

A novel bit-flipping (BF) decoding algorithm is proposed for structured low-density parity-check (LDPC) codes. The proposed BF algorithm which is called multi-threshold bit-flipping (MTBF) algorithm, flips multiple bits by using multiple thresholds at each iteration. It only requires some real operations before iterations and requires only logical operations during the iterations. The MTBF algorithm has lower complexity than the weighted bit-flipping algorithm and its modifications. Simulations show that the proposed algorithm has fast convergence speed and good performance.

An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.

The bit-flipping (BF) algorithm for decoding of low-density parity-check (LDPC) codes requires less complex hardware than other decoding algorithms, but its error correcting performance needs to be improved. In this letter, a threshold adaptation scheme is applied to BF algorithm based decoding of LDPC codes. Our experiments show that the optimal threshold value for BF depends on the error conditions, and threshold adjustment during decoding helps to prevent meaningless no-flipping iterations. Based on these statistical observations, the adaptive threshold technique is proposed to pursue both the maximum error correcting capability and the fastest decoding convergence.