Dynamic Schedules Based on Variable Nodes Residual for LDPC Codes

Layered belief-propagation (LBP) with dynamic schedule for low-density parity-check (LDPC) codes using variable nodes residual is presented. The proposed schedule outperforms the conventional LBP with predetermined schedule both in terms of convergence speed and error performance. As compared with node-wised residual belief-propagation (NRBP), it has much lower extra complexity. For LDPC code constructed by PEG, simulation results show that the new schedule offers better error performance and requires much lower extra complexity.