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 Congress on Image and Signal Processing (CISP)

A new simplified RRWBF decoding algorithm for LDPC decoder in CMMB

Xiangran Sun, Yunyun Wei

Published Oct 1, 2014• 2 citations
Publisher

Abstract

A new soft-value bit-flipping low-density parity-check (LDPC) decoding is proposed based on a simplified reliability ratio based on weighted bit-flipping (RRWBF) algorithm. Moreover, we design a soft-output demapping and soft-decision decoding for the LDPC code in China Mobile Multimedia Broadcasting (CMMB). In addition, the complexity of decoding and the consumption of hardware is reduced effectively by our proposed simplified algorithm.

DOI
10.1109/cisp.2014.7003892

Related papers

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

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

A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes

Chakir Aqil, Ismail Akharraz, Abdelaziz Ahaitouf

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low‐Density Parity‐Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.

Wireless Communications and Mobile Computing•Jan 1, 2021•10 citations

Low complexity iterative decoding algorithm for low-density parity-check (LDPC) codes

Hany R. Zeidan, Maha Mohamed Elsabrouty

The reliability ratio weighted based bit-flipping (RRWBF) algorithm for decoding low-density parity-check (LDPC) codes has recently been developed to provide the best performance among all existing bit-flipping based algorithms. The implementation efficient reliability ratio weighted based bit-flipping (IERRWBF) algorithm speedup the original algorithm to decrease the processing time used. A drawback for this algorithm is the decrease in the improvement as the maximum number of iterations assigned for the algorithm increase as a large percentage of decoding time is spent on the iteration part without any change in the performance. In this paper, a modified version for this algorithm is proposed to solve this drawback by reducing the number of iterations required to achieve the same performance of the existing IERRWBF algorithm using efficient number of iterations instead of using the maximum number of iterations for decoding without any change in the performance of the IERRWBF.

IFIP Wireless Days•Nov 1, 2008•9 citations

An efficient bit-flipping decoding algorithm for LDPC codes

Tso-Cho Chen

In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•6 citations

An Improved Multi-bit Flipping Algorithm for LDPC Decoding

Lan Tang

The bit-flipping(BF) algorithm of low density parity check(LDPC) code has low computation complexity and great practicability.On the basis of studying simple BF,WBF and RRWBF,an improved BF algorithm is proposed on considering the reliability ratio and absolute value of symbol.The proposed algorithm flips more than one bit in each iteration.Simulation results indicate that compared with RRWBF,the error rate of the proposed algorithm with 5 dB is improved from 10-3 to 10-4.

Modern Electronics Technique•Jan 1, 2011•0 citations
A new soft-value bit-flipping low-density parity-check (LDPC) decoding is proposed based on a simplified reliability ratio based on weighted bit-flipping (RRWBF) algorithm. Moreover, we design a soft-output demapping and soft-decision decoding for the LDPC code in China Mobile Multimedia Broadcasting (CMMB). In addition, the complexity of decoding and the consumption of hardware is reduced effectively by our proposed simplified algorithm.
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.
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.
In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low‐Density Parity‐Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.
The reliability ratio weighted based bit-flipping (RRWBF) algorithm for decoding low-density parity-check (LDPC) codes has recently been developed to provide the best performance among all existing bit-flipping based algorithms. The implementation efficient reliability ratio weighted based bit-flipping (IERRWBF) algorithm speedup the original algorithm to decrease the processing time used. A drawback for this algorithm is the decrease in the improvement as the maximum number of iterations assigned for the algorithm increase as a large percentage of decoding time is spent on the iteration part without any change in the performance. In this paper, a modified version for this algorithm is proposed to solve this drawback by reducing the number of iterations required to achieve the same performance of the existing IERRWBF algorithm using efficient number of iterations instead of using the maximum number of iterations for decoding without any change in the performance of the IERRWBF.
In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.