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

International Conference on Wireless Communications and Signal Processing (WCSP)

Combined modified weighted bit-flipping decoding of low-density parity-check codes

Haiyi Huang, Yige Wang, Gang Wei

Published Oct 1, 2012• 1 citation
Publisher

Abstract

In this paper, we propose a combined modified weighted bit-flipping (CM-WBF) algorithm for low-density parity-check (LDPC) codes. The new algorithm combines modified weighted bit-flipping (M-WBF) with low complexity weighted bit-flipping (LC-WBF). Simulation results show that the new algorithm offers a better trade-off among performance, complexity, and convergence compared with M-WBF, LC-WBF and RR-WBF algorithms for finite geometry LDPC (FG-LDPC) codes.

DOI
10.1109/wcsp.2012.6542856

Related papers

A modified weighted bit-flipping algorithm for LDPC codes

Haigang Zhang, Dongfeng Yuan, Cheng‐Xiang Wang

In this paper, a modified weighted bit-flipping (WBF) algorithm is proposed for finite geometry low-density parity-check (FG-LDPC) codes. The calculation for the flipping function in the new method includes all the elements in sum product algorithm (SPA) instead of the minimum one in most existing methods. Simulation results show that the proposed method exhibits better performance than the best method available in the literature so far. The performances of different algorithms are also considered in random constructed LDPC codes. The reliability ratio based WBF (RRWBF) method performs the best in this kind of codes and the proposed method performs very closely to the RRWBF method. The decoding complexities for both FG-LDPC and random constructed LDPC are also analyzed.

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2008•1 citation

Mixed modified weighted bit‐flipping decoding of low‐density parity‐check codes

Haiyi Huang, Yige Wang, Gang Wei

In this study, a new weighted bit‐flipping (WBF) algorithm called mixed modified WBF (MM‐WBF) decoding is proposed for low‐density parity‐check codes. The new algorithm is built by mixing two WBF algorithms, one acting as the main decoding algorithm and the other acting as the auxiliary. Simulation results show that the new algorithm achieves a notable performance gain over reliability ratio‐based WBF, improved M‐WBF and low‐complexity WBF algorithms with almost the same computational complexity. Compared with some belief‐propagation‐based algorithms, MM‐WBF also provides an appealing performance against complexity trade‐off.

IET Communications•Dec 9, 2014•12 citations

Bootstrapped Modified Weighted Bit Flipping Decoding of Low Density Parity Check Codes

Yoichi Inaba

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.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Apr 1, 2006•2 citations

Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms

Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian

Abstract We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length N, the decoding complexity is reduced from O(N2) to O(N). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.

EURASIP Journal on Wireless Communications and Networking•Sep 21, 2020•9 citations

Improved low-complexity low-density parity-check decoding

Zhiqiang Cui, Z. Wang

A practical low-complexity decoding of low-density parity-check codes is studied. A fast decoding scheme for weighted bit-flipping (WBF) based algorithms is first proposed. Then, an optimised 2 bit decoding scheme and its VLSI architecture are presented. It is shown that the new approach has significantly better decoding performance while having comparable hardware complexity compared with WBF-based algorithms.

IET Communications•Aug 22, 2008•9 citations

Sum of the magnitude based weighted bit-flipping decoding algorithms for LDPC codes

Zhang Gao-yua

Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.

Systems engineering and electronics•Jan 1, 2014•0 citations
In this paper, we propose a combined modified weighted bit-flipping (CM-WBF) algorithm for low-density parity-check (LDPC) codes. The new algorithm combines modified weighted bit-flipping (M-WBF) with low complexity weighted bit-flipping (LC-WBF). Simulation results show that the new algorithm offers a better trade-off among performance, complexity, and convergence compared with M-WBF, LC-WBF and RR-WBF algorithms for finite geometry LDPC (FG-LDPC) codes.
In this paper, a modified weighted bit-flipping (WBF) algorithm is proposed for finite geometry low-density parity-check (FG-LDPC) codes. The calculation for the flipping function in the new method includes all the elements in sum product algorithm (SPA) instead of the minimum one in most existing methods. Simulation results show that the proposed method exhibits better performance than the best method available in the literature so far. The performances of different algorithms are also considered in random constructed LDPC codes. The reliability ratio based WBF (RRWBF) method performs the best in this kind of codes and the proposed method performs very closely to the RRWBF method. The decoding complexities for both FG-LDPC and random constructed LDPC are also analyzed.
In this study, a new weighted bit‐flipping (WBF) algorithm called mixed modified WBF (MM‐WBF) decoding is proposed for low‐density parity‐check codes. The new algorithm is built by mixing two WBF algorithms, one acting as the main decoding algorithm and the other acting as the auxiliary. Simulation results show that the new algorithm achieves a notable performance gain over reliability ratio‐based WBF, improved M‐WBF and low‐complexity WBF algorithms with almost the same computational complexity. Compared with some belief‐propagation‐based algorithms, MM‐WBF also provides an appealing performance against complexity trade‐off.
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.
Abstract We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length N, the decoding complexity is reduced from O(N2) to O(N). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.
Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.