Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

Sheryl L. Howard, Christian Schlegel, Vincent C. Gaudet

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


This brief examines different parity-check node decoding algorithms for low-density parity-check (LDPC) codes, seeking to recoup the performance loss incurred by the min-sum approximation compared to sum–product decoding. Two degree-matched check node decoding approximations that depend on the check node degree dc are presented. Both have low complexity and can be applied to any degree distribution. Simulation results show near sum–product decoding performance for both degree-matched check node approximations for regular and irregular LDPCs.

Original languageEnglish (US)
Pages (from-to)1054-1058
Number of pages5
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Issue number10
StatePublished - Oct 2006


  • Iterative decoding
  • LDPC codes
  • reduced-complexity decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Degree-Matched Check Node Decoding for Regular and Irregular LDPCs'. Together they form a unique fingerprint.

Cite this