Effective lazy schedule for the layered belief propagation algorithm

This study presents an effective lazy schedule (LS) for the layered belief propagation (LS-LBP) algorithm; it significantly reduces the number of iterations and the error floors of decoding. This novel LS forces a check node into a sleep status when the reliabilities of its neighbour variable nodes exceed the threshold, and the check node will turn to awake as all the nodes are in sleep status. This LS reduces latency by ignoring useless check-node processes, and it also achieves a low error rate by overcoming some trapping sets. The simulation experiment shows that when compared to the classical layered belief propagation for world interoperability for microwave access (WiMAX), random codes constructed using the progressive edge-growth (PEG codes) algorithm, and digital video broadcasting-satellite-second generation (DVB-S2) codes, this LS increases the decoding convergence speed by up to 36% to achieve the bit error rate 1 × 10 -6 and reduces the error floors to 20-45% for the PEG and DVB-S2 codes. Compared with other schedules for the layered belief propagation, the LS-LBP algorithm is more suitable for the codes with a long block length and has lower complexity.

[1]  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.

[2]  Simon Litsyn,et al.  Efficient layers-based schedules for iterative decoding of LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  Youyun Xu,et al.  Optimized decoding schedule for irregular LDPC codes , 2009 .

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

[5]  Simon Litsyn,et al.  Lazy scheduling forLDPC decoding , 2007, IEEE Communications Letters.

[6]  C. K. Michael Tse,et al.  Performance evaluation of irregular low-density parity-check codes at high signal-to-noise ratio , 2011, IET Commun..

[7]  Guo-jun Han,et al.  Dynamic Schedules Based on Variable Nodes Residual for LDPC Codes , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[8]  Pangan Ting,et al.  Modified layered message passing decoding with dynamic scheduling and early termination for QC-LDPC codes , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[9]  Babak Daneshrad,et al.  Computationally efficient decoding of LDPC codes , 2009 .

[10]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[11]  Zhongfeng Wang,et al.  Reduced-complexity column-layered decoding and implementation for LDPC codes , 2011, IET Commun..

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

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

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

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

[16]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[17]  Mong-Kai Ku,et al.  Low-complexity iteration control algorithm for multi-rate partially parallel layered LDPC decoders , 2012 .

[18]  Ieee Microwave Theory,et al.  Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems — Amendment for Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands , 2003 .

[19]  Bahram Honary,et al.  Low-complexity decoding of LDPC codes , 2007 .

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

[21]  Huazhong Yang,et al.  Efficient construction of irregular codes with midterm block length and near-shannon performance , 2011, IET Commun..

[22]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.