Improving LDPC Decoders via Informed Dynamic Scheduling

@article{Casado2007ImprovingLD,
  title={Improving LDPC Decoders via Informed Dynamic Scheduling},
  author={A.I.V. Casado and Miguel Griot and R D Wesel},
  journal={2007 IEEE Information Theory Workshop},
  year={2007},
  pages={208-213}
}
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 message-passing schedule of the BP algorithm significantly affects the performance of the LDPC decoder. The authors recently presented a novel message-passing schedule, called Informed Dynamic Scheduling (IDS), that selects the message-passing schedule according to the observed rate of change of the messages. IDS yields a… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

0204020082009201020112012201320142015201620172018
Citations per Year

86 Citations

Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.