Lower-complexity layered belief-propagation decoding of LDPC codes

Yuan Mao Chang*, Andres I. Vila Casado, Mau-Chung Chang, Richard D. Wesel

*Corresponding author for this work

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

18 Scopus citations


The design of LDPC decoders with low complexity, high throughput, and good performance is a critical task. A well-known strategy is to design structured codes such as quasi-cyclic LDPC (QC-LDPC) that allow partially-parallel decoders. Sequential schedules, such as Layered Belief-Propagation (LBP), converge faster than the traditional flooding schedule while allowing parallel decoding of QC-LDPC codes. In this paper, we propose a novel low-complexity sequential schedule called Zigzag LBP (Z-LBP). Current LBP schedules do not allow partially-parallel architectures in the regime of high-rate codes with small-to-medium blocklengths. Our proposed algorithm can still be implemented in a partially-parallel manner in this regime. Z-LBP provides the same benefits as LBP including faster convergence speed and lower frame error rates than flooding.

Original languageEnglish
Title of host publicationICC 2008 - IEEE International Conference on Communications, Proceedings
Number of pages6
StatePublished - 12 Sep 2008
EventIEEE International Conference on Communications, ICC 2008 - Beijing, China
Duration: 19 May 200823 May 2008

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486


ConferenceIEEE International Conference on Communications, ICC 2008


  • Belief-propagation
  • Channel codes
  • Error-control codes
  • Low-density parity-check codes

Fingerprint Dive into the research topics of 'Lower-complexity layered belief-propagation decoding of LDPC codes'. Together they form a unique fingerprint.

Cite this