Variable-to-check residual belief propagation for informed dynamic scheduling of LDPC codes

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-tocheck 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.