Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes

摘要

This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.