Computer Science – Information Theory
Scientific paper
2007-02-19
Computer Science
Information Theory
6 pages, 4 figures
Scientific paper
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The traditional message-passing schedule 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 raises the problem of finding the best sequence of message updates. This paper presents practical scheduling strategies that use the value of the messages in the graph to find the next message to be updated. Simulation results show that these informed update sequences require significantly fewer iterations than standard sequential schedules. Furthermore, the paper shows that informed scheduling solves some standard trapping set errors. Therefore, it also outperforms traditional scheduling for a large numbers of iterations. Complexity and implementability issues are also addressed.
Griot Miguel
Vila Casado Andres I.
Wesel Richard D.
No associations
LandOfFree
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383359