LDPC Decoders with Informed Dynamic Scheduling
Authors:
Top Cited Papers
- 28 October 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 58 (12) , 3470-3479
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Generic Description and Synthesis of LDPC DecodersIEEE Transactions on Communications, 2007
- Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes2007
- Optimized Message Passing Schedules for LDPC Decoding2006
- A Reduced Complexity Decoder Architecture via Layered Decoding of LDPC Codes2004
- An efficient message-passing schedule for LDPC decoding2004
- Parallel versus sequential updating for belief propagation decodingPhysica A: Statistical Mechanics and its Applications, 2003
- High-throughput LDPC decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check CodesElectronic Notes in Theoretical Computer Science, 2003
- High throughput low-density parity-check decoder architectures2002
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999