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

Video Engineering

BP Decoding Algorithm Based on Nodes Residual for LDPC Code

Xinqiao Yu

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

The Variable to Check Residual Belief Propagation(VC-RBP) for LDPC codes is researched in this paper.It is a dynamic scheduling belief propagation using residuals between nodes,and has some advantages,such as fast decoding,good performance,and low complexity.It is similar to Residual Belief Propagation(RBP),but has some difference in computing the residual message.Simulating results show that the proposed method is about 0.28 dB better than RBP when BER is 10-4 and the iteration number is 10.

Related papers

A BP decoding algorithm based on nodes residual for LDPC codes

Zhongxun Wang, Xingcheng Wang, Xinqiao Yu +1 more

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.

Wireless Communications, Networking and Information Security•Jun 1, 2010•4 citations

A BP Decoding Algorithm Based on Nodes Residual for LDPC Codes and Its Hardware Implementation

Zhongxun Wang, Xingcheng Wang, Fangqiang Zhu

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages，such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. This paper further optimized the new algorithm on DSP of TMS320dm6446, and it is good for hardware implementation.

Advanced Science Letters•Mar 15, 2012•0 citations

A BP Decoding Algorithm Based on Nodes Residual for LDPC Codes and its Hardware Implementation

Zhong Xun Wang, Xing Cheng Wang, Fang Qiang Zhu

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages，such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. This paper further optimized the new algorithm on DSP of TMS320dm6446, and it is good for hardware implementation.

Applied Mechanics and Materials•Oct 1, 2011•0 citations

Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes

Huilian Zhang, Shaoping Chen

Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy, can significantly accelerate the convergence speed. However, RBP decoding suffers from a poor convergence error-rate performance due to its greedy property, which is one of the challenging issues in the design of IDS strategies. To tackle this problem, a novel IDS scheme, namely residual-decaying-based residual belief-propagation (RD-RBP) algorithm, is presented in this paper. In RD-RBP, a decaying mechanism is introduced to manipulate the residuals of those check-to-variable messages, preventing the decoding resources from being unreasonably occupied by a small group of edges in the Tanner graph. The greediness is therefore alleviated and better performance of convergence error-rate is achieved. Besides, a two-stage scheduling scheme combining prior-art variable-node and variable-to-check-edge RBP (V-VCRBP) with RD-RBP, named V-VC-RD-RBP, is proposed for achieving both fast convergence speed and a low convergence error-rate. The simulation results validate the advantages of the proposed schemes.

IEEE Access•Jan 1, 2019•19 citations

Variable-to-Check Residual Belief Propagation for informed dynamic scheduling of LDPC codes

Jung Hyun Kim, Mi-Young Nam, Hong‐Yeop Song +1 more

We propose Variable-to-Check Residual Belief Propagation (VCRBP) for LDPC decoding for faster convergence, better error correcting performance and lower complexity. It is similar to Residual Belief Propagation (RBP) that was recently applied to LDPC decoding by Vila Casado et al. because it is also a dynamic scheduling belief propagation using residuals, but it is different because its residuals are computed from variable-to-check message. Simulation shows that it out-performs with only maximum 8 iterations by about 0.3 dB compared with RBP at an FER of 10-4. Also, we propose node-wise VCRBP (N-VCRBP) for reducing complexity of VCRBP. N-VCRBP also exhibits the performance very close to VCRBP but with significantly lower decoding complexity.

International Symposium on Information Theory and its Applications•Dec 1, 2008•14 citations

Variable-to-check residual belief propagation for LDPC codes

Jeong‐Ho Kim, Mi-Young Nam, Hong‐Yeop Song

Variable-to-check residual belief propagation for LDPC decoding for faster convergence, better error performance and lower complexity is proposed. It is similar to residual belief propagation (RBP) that was recently applied to LDPC decoding by Vila Casado et al. because it is also a dynamic scheduling belief propagation using residuals, but it is different because the residuals are computed from a variable-to-check message. Simulation shows that it outperforms with only a maximum of eight iterations by about 0.3 dB compared with RBP at an FER of 10−4.

Electronics Letters•Jan 13, 2009•36 citations
The Variable to Check Residual Belief Propagation(VC-RBP) for LDPC codes is researched in this paper.It is a dynamic scheduling belief propagation using residuals between nodes,and has some advantages,such as fast decoding,good performance,and low complexity.It is similar to Residual Belief Propagation(RBP),but has some difference in computing the residual message.Simulating results show that the proposed method is about 0.28 dB better than RBP when BER is 10-4 and the iteration number is 10.
We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy, can significantly accelerate the convergence speed. However, RBP decoding suffers from a poor convergence error-rate performance due to its greedy property, which is one of the challenging issues in the design of IDS strategies. To tackle this problem, a novel IDS scheme, namely residual-decaying-based residual belief-propagation (RD-RBP) algorithm, is presented in this paper. In RD-RBP, a decaying mechanism is introduced to manipulate the residuals of those check-to-variable messages, preventing the decoding resources from being unreasonably occupied by a small group of edges in the Tanner graph. The greediness is therefore alleviated and better performance of convergence error-rate is achieved. Besides, a two-stage scheduling scheme combining prior-art variable-node and variable-to-check-edge RBP (V-VCRBP) with RD-RBP, named V-VC-RD-RBP, is proposed for achieving both fast convergence speed and a low convergence error-rate. The simulation results validate the advantages of the proposed schemes.
We propose Variable-to-Check Residual Belief Propagation (VCRBP) for LDPC decoding for faster convergence, better error correcting performance and lower complexity. It is similar to Residual Belief Propagation (RBP) that was recently applied to LDPC decoding by Vila Casado et al. because it is also a dynamic scheduling belief propagation using residuals, but it is different because its residuals are computed from variable-to-check message. Simulation shows that it out-performs with only maximum 8 iterations by about 0.3 dB compared with RBP at an FER of 10-4. Also, we propose node-wise VCRBP (N-VCRBP) for reducing complexity of VCRBP. N-VCRBP also exhibits the performance very close to VCRBP but with significantly lower decoding complexity.
Variable-to-check residual belief propagation for LDPC decoding for faster convergence, better error performance and lower complexity is proposed. It is similar to residual belief propagation (RBP) that was recently applied to LDPC decoding by Vila Casado et al. because it is also a dynamic scheduling belief propagation using residuals, but it is different because the residuals are computed from a variable-to-check message. Simulation shows that it outperforms with only a maximum of eight iterations by about 0.3 dB compared with RBP at an FER of 10−4.