LDPC Decoders with Informed Dynamic Scheduling

Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation (BP), or message-passing, algorithm over the factor graph of the code. The traditional message-passing scheduling, called flooding, consists of updating all the variable nodes in the graph, using the same pre-update information, followed by updating all the check nodes of the graph, again, using the same pre-update information. Recently, several studies show that sequential scheduling, in which messages are generated using the latest available information, significantly improves the convergence speed in terms of number of iterations. Sequential scheduling introduces the problem of finding the best sequence of message updates. We propose Informed Dynamic Scheduling (IDS) strategies that select the message-passing schedule according to the observed rate of change of the messages. In general, IDS strategies require computation to select the message to update but converge in fewer message updates because they focus on the part of the graph that has not converged. Moreover, IDS yields a lower error-rate performance than either flooding or sequential scheduling because IDS strategies overcome traditional trapping-set errors. This paper presents IDS strategies that address several issues including performance for short-blocklength codes, complexity, and implementability.

[1]  Luca Fanucci,et al.  Layered Decoding of Non-Layered LDPC Codes , 2006, 9th EUROMICRO Conference on Digital System Design (DSD'06).

[2]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[3]  Richard D. Wesel,et al.  Overcoming LDPC Trapping Sets with Informed Scheduling , 2007 .

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

[5]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

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

[7]  Valentin Savin,et al.  Iterative LDPC decoding using neighborhood reliabilities , 2007, 2007 IEEE International Symposium on Information Theory.

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

[9]  Payam Pakzad,et al.  Abstract—two Decoding Schedules and the Corresponding Serialized Architectures for Low-density Parity-check (ldpc) , 2001 .

[10]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[11]  Jean-Luc Danger,et al.  Generic Description and Synthesis of LDPC Decoders , 2007, IEEE Transactions on Communications.

[12]  H. Kfir,et al.  Parallel versus sequential updating for belief propagation decoding , 2002, cond-mat/0207185.

[13]  David J. C. MacKay,et al.  Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.

[14]  G. A. Margulis,et al.  Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..

[15]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[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]  Richard D. Wesel,et al.  Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.

[18]  Richard D. Wesel,et al.  Construction of short block length irregular low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

[20]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[21]  Joseph R. Cavallaro,et al.  Optimized Message Passing Schedules for LDPC Decoding , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[22]  S. Litsyn,et al.  An efficient message-passing schedule for LDPC decoding , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[23]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

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

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