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 Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)

Weighted bit-flipping decoding for product LDPC codes

Sirawit Khittiwitchayakul, Watid Phakphisut, Pornchai Supnithi

Published Jun 1, 2016• 3 citations
Publisher

Abstract

In this work, we propose a weighted bit-flipping (WBF) decoding for product LDPC codes of which decoding complexity is lower than the belief-propagation (BP) decoding. Two distinct types based on page computations and row/column computations are proposed. In addition, we address an issue of hard decision algorithm for product LDPC codes suffering a performance degradation at high iteration numbers. We introduce a threshold of flipped bits to adjust the performance at high iterations. Although the performances of both proposed decoding are worse than that of the BP algorithm, it greatly reduces the decoding complexity.

DOI
10.1109/ecticon.2016.7561399

Related papers

Revised Hard-decision Decoding of LDPC Codes

Hongwei Li

Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.

Video Engineering•Jan 1, 2013•0 citations

Theoretic approach to BP-based WBF decoding algorithm of LDPC codes

Erl‐Huei Lu, Tso-Cho Chen, Pen‐Yao Lu

A theoretic approach to the belief-propagation - based weighted bit-flipping (BP-based WBF) algorithm is proposed for decoding low-density parity-check codes. The decoding algorithm can be easily simplified to IMWBF, MWBF, WBF or BF decoding algorithms by setting different parameters; hence it could offer a high flexible performance/complexity trade-off for hybrid decoding.

International Symposium on Wireless Pervasive Computing•Nov 1, 2013•8 citations

Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes

Zhu Qing, Lenan Wu

Low-density parity-check (LDPC) codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications. LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP) over the corresponding Tanner graph. The original BP updates all the variable-nodes simultaneously, followed by all the check-nodes simultaneously as well. We propose a sequential scheduling algorithm based on weighted bit-flipping (WBF) algorithm for the sake of improving the convergence speed. Notoriously, WBF is a low-complexity and simple algorithm. We combine it with BP to obtain advantages of these two algorithms. Flipping function used in WBF is borrowed to determine the priority of scheduling. Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes.

Mathematical Problems in Engineering•Jan 1, 2013•6 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

Towards Understanding Weighted Bit-Flipping Decoding

Xiaofu Wu, Cong Ling, Ming Jiang +3 more

A natural relationship between weighted bit-flipping (WBF) decoding and message-passing decoding is explored. This understanding can help us develop a dual WBF decoding algorithm from one type of message-passing decoding algorithm and vice versa. For min-sum decoding, one can find that its dual WBF algorithm is the algorithm proposed by Jiang et al. For belief-propagation (BP) decoding, we propose a new WBF algorithm and show its performance advantage. For some high-rate low-density parity-check (LDPC) codes of large row weight, it is shown that the WBF algorithm proposed by Liu and Pados performs extraordinarily well. However, its dual message- passing decoding does not work well. Furthermore, we propose a parallel implementation framework for various WBF algorithms. Compared to serial implementations, various WBF algorithms in their parallel form converge significantly faster and often perform better.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•6 citations

A low complexity and high performance LDPC decoding algorithm

Junming Chang, Hao Wang, Chuiyuan Kong

LDPC (Low Density Parity Check Codes) is a low -density puppet test code applied to channel codes. Among the existing LDPC decoding algorithms, the LLR-BP decoding arithmetic is too complicated to calculate the calculation due to the containing a large number of bilateral positive cut functions. Therefore, this article proposes a LDPC decoding algorithm that combines the Modified Weighted Bit Flipping Decoding Algorithm (MWBF) with the Logarithmic Likelihood Ratio Based Confidence Propagation Algorithm (LLR-BP). In the process of the LLR-BP decoding iteration, the introduction of the MWBF algorithm not only does it reduce the complexity of iteration and decoding, but also avoids the traditional weighted bit-flipping decoding algorithm (WBF). Excessive effects of code performance.

International Conference on Digital Signal and Computer Communications (DSCC)•Jul 28, 2023•1 citation
In this work, we propose a weighted bit-flipping (WBF) decoding for product LDPC codes of which decoding complexity is lower than the belief-propagation (BP) decoding. Two distinct types based on page computations and row/column computations are proposed. In addition, we address an issue of hard decision algorithm for product LDPC codes suffering a performance degradation at high iteration numbers. We introduce a threshold of flipped bits to adjust the performance at high iterations. Although the performances of both proposed decoding are worse than that of the BP algorithm, it greatly reduces the decoding complexity.
Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.
Low-density parity-check (LDPC) codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications. LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP) over the corresponding Tanner graph. The original BP updates all the variable-nodes simultaneously, followed by all the check-nodes simultaneously as well. We propose a sequential scheduling algorithm based on weighted bit-flipping (WBF) algorithm for the sake of improving the convergence speed. Notoriously, WBF is a low-complexity and simple algorithm. We combine it with BP to obtain advantages of these two algorithms. Flipping function used in WBF is borrowed to determine the priority of scheduling. Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes.
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.
A natural relationship between weighted bit-flipping (WBF) decoding and message-passing decoding is explored. This understanding can help us develop a dual WBF decoding algorithm from one type of message-passing decoding algorithm and vice versa. For min-sum decoding, one can find that its dual WBF algorithm is the algorithm proposed by Jiang et al. For belief-propagation (BP) decoding, we propose a new WBF algorithm and show its performance advantage. For some high-rate low-density parity-check (LDPC) codes of large row weight, it is shown that the WBF algorithm proposed by Liu and Pados performs extraordinarily well. However, its dual message- passing decoding does not work well. Furthermore, we propose a parallel implementation framework for various WBF algorithms. Compared to serial implementations, various WBF algorithms in their parallel form converge significantly faster and often perform better.
LDPC (Low Density Parity Check Codes) is a low -density puppet test code applied to channel codes. Among the existing LDPC decoding algorithms, the LLR-BP decoding arithmetic is too complicated to calculate the calculation due to the containing a large number of bilateral positive cut functions. Therefore, this article proposes a LDPC decoding algorithm that combines the Modified Weighted Bit Flipping Decoding Algorithm (MWBF) with the Logarithmic Likelihood Ratio Based Confidence Propagation Algorithm (LLR-BP). In the process of the LLR-BP decoding iteration, the introduction of the MWBF algorithm not only does it reduce the complexity of iteration and decoding, but also avoids the traditional weighted bit-flipping decoding algorithm (WBF). Excessive effects of code performance.