Variable-to-check residual belief propagation for LDPC codes

Abstract

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.