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 Symposium on Information Theory and its Applications

Rate estimation scheme for weighted bit-flipping decoding of rate compatible LDPC codes

Kenji Kita, Tetsuo Tsujioka

Published Dec 1, 2008• 0 citations
Publisher

Abstract

This paper considers a new rate estimation scheme for rate compatible LDPC (RC-LDPC) codes. We have investigated some estimation schemes for RC-LDPC codes even though there is no side information about code rates used at a transmitter. The previous schemes were based on log-likelihood ratio of sum-product decoders at a receiver. Because of too much computational complexity, simpler estimation schemes are expected to be developed. For this purpose, we focus on a simpler decoding scheme, thus weighted bit-flipping (WBF) decoding which have been much attention by many reseachers recently. In this paper, we propose a new rate estimation scheme and evaluate its performance. Simulation results show that the proposed scheme has advantages of much effectiveness and potential for estimating code rates.

DOI
10.1109/isita.2008.4895385

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

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

New Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Zi-jian Dong, Tiecheng Song

Several Weighted BF (WBF) algorithms are investigated in this paper, and a novel modified reliability-ratio based WBF (MRWBF) decoding algorithm for LDPC codes is proposed.WBF algorithm considers the influence of parity information on the error metric.Based on WBF, the improved WBF (IWBF) algorithm further uses the feature of message reliability on the symbol decision.The reliability-ratio based WBF (RRWBF) can eliminate the defect of requiring off-line pre-processing in IWBF.Our proposed MRWBF further removes the step of calculating normalized weighted parameters in RRWBF and achieves more reduction in decoding complexity.The results of simulations show that the proposed algorithm is feasible, effective, and can achieve good decoding performance.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2013•4 citations

An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability

Tso-Cho Chen, Erl‐Huei Lu, Chia-Jung LI +1 more

In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.

IEICE Transactions on Communications•Jan 1, 2017•1 citation

Reliability Ratio Based Weighted Bit-Flipping Decoding for LDPC codes

Feng Guo, L. Hanzo

In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.

IEEE Vehicular Technology Conference•Dec 10, 2005•15 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
This paper considers a new rate estimation scheme for rate compatible LDPC (RC-LDPC) codes. We have investigated some estimation schemes for RC-LDPC codes even though there is no side information about code rates used at a transmitter. The previous schemes were based on log-likelihood ratio of sum-product decoders at a receiver. Because of too much computational complexity, simpler estimation schemes are expected to be developed. For this purpose, we focus on a simpler decoding scheme, thus weighted bit-flipping (WBF) decoding which have been much attention by many reseachers recently. In this paper, we propose a new rate estimation scheme and evaluate its performance. Simulation results show that the proposed scheme has advantages of much effectiveness and potential for estimating code rates.
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.
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.
Several Weighted BF (WBF) algorithms are investigated in this paper, and a novel modified reliability-ratio based WBF (MRWBF) decoding algorithm for LDPC codes is proposed.WBF algorithm considers the influence of parity information on the error metric.Based on WBF, the improved WBF (IWBF) algorithm further uses the feature of message reliability on the symbol decision.The reliability-ratio based WBF (RRWBF) can eliminate the defect of requiring off-line pre-processing in IWBF.Our proposed MRWBF further removes the step of calculating normalized weighted parameters in RRWBF and achieves more reduction in decoding complexity.The results of simulations show that the proposed algorithm is feasible, effective, and can achieve good decoding performance.
In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.
In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.
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.