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•11 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•7 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

A Modification to Weighted Bit-Flipping Decoding Algorithm for LDPC Codes Based on Reliability Adjustment

D. Qian, M. Jiang, Chihang Zhao +1 more

In this paper, a modification to the weighted bit- flipping (WBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. This modification, based on the adjustment in reliabilities of the check sums during iterative decoding, can be applied to various WBF algorithms. Our studies show that the modification can be achieved with a small increase in complexity, but leads to an appealing improvement in error performance.

International Conference on Communications•Jan 1, 2008•4 citations

Studies on Practical Low Complexity Decoding of Low-Density Parity-Check Codes

Zhiqiang Cui, Zhongfeng Wang

This paper studies practical low complexity decoding of Low Density Parity-Check (LDPC) codes. We first investigate VLSI implementation issues of two state-of-the-art Weighted Bit Flipping (WBF) based decoding algorithms that were recently proposed in the literature. Then we present an optimized 2-bit soft decoding approach. It is shown that the proposed approach has comparable hardware complexity with either of the two WBF-based algorithms while it has significantly better decoding performance.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2007•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.
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.