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

Microelectronics & Computer

Self Reliability Based Low Complexity Bit-flipping Decoding Algorithm for LDPC Codes

Lan Dong

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

A new low complexity and implement efficient bit-flipping decoding algorithm for Low-Density Parity-Check(LDPC) codes is presented in this paper.The proposed algorithm computes the flipping function by the intrinsic value of the message node,and it reduces the requirement of the information from other message nodes.So,it has a lower complexity and still guarantees the reliability of the flipping function.The simulation results for RS-based LDPC codes using the proposed algorithm show that it has the performance approaching the IMWBF algorithm or even better.

Related papers

A self-normalized weighted bit-flipping decoding algorithm for LDPC codes

Chunli Wang, Xiaofu Wu, Wei‐Ping Zhu

A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•1 citation

A Two-Bit Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Jieun Oh, Jeongseok Ha

This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliability bits are exchanged between bit and check nodes as the decoding proceeds. The message update in check nodes is carefully devised with simple bitwise operations, which are especially suitable for high-speed operations. It will be demonstrated that the proposed TB-WBFA achieves a significant performance improvement over existing bit-flipping decoding algorithms by conducting performance comparisons for LDPC codes under various setups, i.e., different rates, lengths, and structures.

IEEE Communications Letters•Feb 26, 2018•16 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

Implementation-efficient reliability ratio based weighted bit-flipping decoding for LDPC codes

C.-H. Lee, Wayne H. Wolf

It was recently shown that the reliability ratio based bit-flipping (RRWBF) decoding algorithm for low-density parity-check (LDPC) codes performs best among existing bit-flipping-based algorithms. A new version of this algorithm is proposed such that decoding time is significantly reduced, especially when the iteration number is small and the code length is large. Simulation results showed the proposed version has up to 2322.39%, 823.90%, 511.79%, and 261.92% speedup compared to the original algorithm on a UNIX workstation for 10, 30, 50, and 100 iterations. It is thus much more efficient to adopt this version for simulation and hardware implementation. Moreover, this version of the RRWBF algorithm provides a more intuitive way of interpreting its superior performance over other bit-flipping-based algorithms.

Electronics Letters•Jun 23, 2005•59 citations

Check of Reliability-Based Bit-Flipping Decoding Algorithm for LDPC Codes

Xia Chen

In this paper,a check of reliability-based bit-flipping(Check Reliability-based Bit Flipping,CR-BF) decoding algorithm for Low Density Parity Check(LDPC) Code is proposed.The CR-BF algorithm flips bits based on the reliability of parity-check equations.Then the number of error parity-check equations is considered to flip more than 1 bit in each iteration.Simulation results show that the proposed algorithms converge faster and achieve better performance.

Journal of Beijing Jiaotong University•Jan 1, 2008•0 citations

Modified LDPC BF Decoding Algorithm Based on Reliability Ratio

Qiang Guo

Compared with belief-propagation decoding algorithm which has complexity class of o(n2),bit-flipping(BF) decoding algorithm for low density parity check(LDPC) codes has only complexity class of o(n).However,the performance of BF algorithm is degraded.This paper presents a modified BF decoding algorithm,which uses reliability ratio as a weight of information node in unsatisfied parity checks so that the soft information is introduced in decoding,and the decoding performance is improved greatly with a little more computation.Analyses show the modified algorithm still has a complexity class of o(n).Simulation results indicate that the error rate with 7dB SNR is improved from 10-3 of the weighted bit-flipping decoding algorithm to 10-4 of the modified algorithm.

Journal of Nanjing University of Science and Technology•Jan 1, 2009•0 citations
A new low complexity and implement efficient bit-flipping decoding algorithm for Low-Density Parity-Check(LDPC) codes is presented in this paper.The proposed algorithm computes the flipping function by the intrinsic value of the message node,and it reduces the requirement of the information from other message nodes.So,it has a lower complexity and still guarantees the reliability of the flipping function.The simulation results for RS-based LDPC codes using the proposed algorithm show that it has the performance approaching the IMWBF algorithm or even better.
A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but also the reliability of each variable node. Compared to the IMWBF algorithm, the proposed algorithm does not require multiplicative normalization and performs even better.
This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliability bits are exchanged between bit and check nodes as the decoding proceeds. The message update in check nodes is carefully devised with simple bitwise operations, which are especially suitable for high-speed operations. It will be demonstrated that the proposed TB-WBFA achieves a significant performance improvement over existing bit-flipping decoding algorithms by conducting performance comparisons for LDPC codes under various setups, i.e., different rates, lengths, and structures.
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
It was recently shown that the reliability ratio based bit-flipping (RRWBF) decoding algorithm for low-density parity-check (LDPC) codes performs best among existing bit-flipping-based algorithms. A new version of this algorithm is proposed such that decoding time is significantly reduced, especially when the iteration number is small and the code length is large. Simulation results showed the proposed version has up to 2322.39%, 823.90%, 511.79%, and 261.92% speedup compared to the original algorithm on a UNIX workstation for 10, 30, 50, and 100 iterations. It is thus much more efficient to adopt this version for simulation and hardware implementation. Moreover, this version of the RRWBF algorithm provides a more intuitive way of interpreting its superior performance over other bit-flipping-based algorithms.
Compared with belief-propagation decoding algorithm which has complexity class of o(n2),bit-flipping(BF) decoding algorithm for low density parity check(LDPC) codes has only complexity class of o(n).However,the performance of BF algorithm is degraded.This paper presents a modified BF decoding algorithm,which uses reliability ratio as a weight of information node in unsatisfied parity checks so that the soft information is introduced in decoding,and the decoding performance is improved greatly with a little more computation.Analyses show the modified algorithm still has a complexity class of o(n).Simulation results indicate that the error rate with 7dB SNR is improved from 10-3 of the weighted bit-flipping decoding algorithm to 10-4 of the modified algorithm.