An Efficient Dynamic Schedule for Layered Belief-Propagation Decoding of LDPC Codes

作者：Han, Guojun; Liu, Xingcheng^*

来源：IEEE Communications Letters, 2009, 13(12): 950-952.

DOI：10.1109/LCOMM.2009.12.091555

• LDPC codes
• dynamic schedule
• layered belief-propagation (LBP)
• residual

An efficient dynamic schedule for layered belief-propagation (LBP) decoding of low-density parity-check (LDPC) codes is presented, in which the check nodes connecting to a variable node with maximum relative message residual are chosen in each dynamic decoding iteration, and then LBP is performed for these check nodes. In this schedule we combined the features of lazy schedule and node-wise residual belief propagation (NWRBP) together while keeping the extra computational complexity very low. Simulation results show that the new schedule speeds up the convergence rate and greatly improves error performance at medium to high signal-to-noise ratio (SNR) when compared to the standard LBP decoding algorithm.

• 单位
  中山大学; 广东工业大学