Edge-based scheduled BP in LDPC codes

Oren Golov, Ofer Amrani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper studies the potential performance gain, referred to as scheduling gain, when decoding LDPC codes using scheduled belief-propagation. Introducing genie-aided scheduling, it is shown that the scheduling-gain can be quite impressive Tor moderate and short-length codes. Adaptive schedule based on edge ordering is presented. This approach compares favorably with serial scheduling schemes based on random node ordering. Density evolution-based analysis appropriately tailored for decoding finite-length LDPC codes is provided. For serial decoding and genie-aided decoding, it is shown that the performance in the first iteration can be accurately predicted analytically using the proposed technique.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Print)1424414296, 9781424414291
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101


Conference2007 IEEE International Symposium on Information Theory, ISIT 2007


Dive into the research topics of 'Edge-based scheduled BP in LDPC codes'. Together they form a unique fingerprint.

Cite this