Variable-Node-Based Dynamic Scheduling Strategy for Belief-Propagation Decoding of LDPC Codes

Among the belief-propagation (BP) decoding algorithms of low-density parity-check (LDPC) codes, the algorithms based on dynamic scheduling strategy show excellent performance. In this letter, we propose a variable-node-based dynamic scheduling decoding algorithm. For the proposed algorithm, the reliability of variable nodes is evaluated based on the log-likelihood ratio (LLR) values and the parity-check equations; then, a more accurate dynamic selection strategy is presented. Simultaneously, the oscillating variable nodes are processed so that the influence of the spread of error messages caused by oscillation are suppressed. In addition, the proposed algorithm updates the same number of messages in one iteration as the original BP decoding algorithm does, which is different from some other dynamic decoding algorithms. Simulation results demonstrate that the proposed algorithm outperforms other algorithms.

[1]  Yong Liang Guan,et al.  Check Node Reliability-Based Scheduling for BP Decoding of Non-Binary LDPC Codes , 2013, IEEE Transactions on Communications.

[2]  Huang-Chang Lee,et al.  LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor , 2014, IEEE Transactions on Communications.

[3]  Yi Gong,et al.  Effective Informed Dynamic Scheduling for Belief Propagation Decoding of LDPC Codes , 2011, IEEE Transactions on Communications.

[4]  Simon Litsyn,et al.  Efficient Serial Message-Passing Schedules for LDPC Decoding , 2007, IEEE Transactions on Information Theory.

[5]  Marc P. C. Fossorier,et al.  Shuffled iterative decoding , 2005, IEEE Transactions on Communications.

[6]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[7]  Hong-Yeop Song,et al.  Variable-to-Check Residual Belief Propagation for informed dynamic scheduling of LDPC codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

[8]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[9]  Ian McGraw,et al.  Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing , 2006, UAI.

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  Xingcheng Liu,et al.  An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes , 2009, IEEE Communications Letters.

[12]  Amir H. Banihashemi,et al.  Decoding low-density parity-check codes with probabilistic scheduling , 2001, IEEE Communications Letters.

[13]  Richard D. Wesel,et al.  LDPC Decoders with Informed Dynamic Scheduling , 2010, IEEE Transactions on Communications.

[14]  Juntan Zhang,et al.  Shuffled belief propagation decoding , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[15]  J. Sayir,et al.  On the Convergence of Log-Likelihood Values in Iterative Decoding , 2002 .

[16]  Huang-Chang Lee,et al.  Two Informed Dynamic Scheduling Strategies for Iterative LDPC Decoders , 2013, IEEE Transactions on Communications.

[17]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[18]  Richard D. Wesel,et al.  Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes , 2007, 2007 IEEE International Conference on Communications.