Reliability-based high-efficient dynamic schedules for belief propagation decoding of LDPC codes

Four reliability-based high-efficient dynamic schedules (RHDS) for belief propagation (BP) decoding of low-density parity-check codes are proposed. The RHDS only processes one variable (or check) node, which has the maximum relative residual among all the variable (or check) nodes in each decoding iteration, thus keeping less greediness and decreasing complexity in comparison with egde-wise variable-to-check residual belief propagation (VC-RBP) algorithm. Simulation results show that RHDS´s convergence rate is higher than VC-RBP while still keeping very low computational complexity.