Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

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

doi:10.1109/TCSII.2006.882204

Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

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

Informatics, Computing, and Cyber Systems, School of

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	1054-1058
Number of pages	5
Journal	IEEE Transactions on Circuits and Systems II: Express Briefs
Volume	53
Issue number	10
DOIs	https://doi.org/10.1109/TCSII.2006.882204
State	Published - Oct 2006

Keywords

Iterative decoding
LDPC codes
reduced-complexity decoding

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCSII.2006.882204

Cite this

@article{ee801464280d49199edbb670b7e14b95,

title = "Degree-Matched Check Node Decoding for Regular and Irregular LDPCs",

abstract = "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.",

keywords = "Iterative decoding, LDPC codes, reduced-complexity decoding",

author = "Howard, {Sheryl L.} and Christian Schlegel and Gaudet, {Vincent C.}",

note = "Funding Information: Manuscript received August 23, 2005; revised March 6, 2006. This work was supported by Alberta iCORE and NSERC. This paper was recommended by Associate Editor B. C. Levy. The authors are with the Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 2V4, Canada (e-mail: sheryl@ece. ualberta.ca; [email protected]; [email protected]). Digital Object Identifier 10.1109/TCSII.2006.882204",

year = "2006",

month = oct,

doi = "10.1109/TCSII.2006.882204",

language = "English (US)",

volume = "53",

pages = "1054--1058",

journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",

issn = "1549-7747",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

AU - Howard, Sheryl L.

AU - Schlegel, Christian

AU - Gaudet, Vincent C.

N1 - Funding Information: Manuscript received August 23, 2005; revised March 6, 2006. This work was supported by Alberta iCORE and NSERC. This paper was recommended by Associate Editor B. C. Levy. The authors are with the Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 2V4, Canada (e-mail: sheryl@ece. ualberta.ca; [email protected]; [email protected]). Digital Object Identifier 10.1109/TCSII.2006.882204

PY - 2006/10

Y1 - 2006/10

N2 - 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.

AB - 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.

KW - Iterative decoding

KW - LDPC codes

KW - reduced-complexity decoding

UR - http://www.scopus.com/inward/record.url?scp=33750591782&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750591782&partnerID=8YFLogxK

U2 - 10.1109/TCSII.2006.882204

DO - 10.1109/TCSII.2006.882204

M3 - Article

AN - SCOPUS:33750591782

SN - 1549-7747

VL - 53

SP - 1054

EP - 1058

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

IS - 10

ER -

Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this