Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

Author

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

Author_Institution

Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta.

Volume

53

Issue

10

fYear

2006

Firstpage

1054

Lastpage

1058

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 d_c 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; parity check codes; iterative decoding; low-density parity-check codes; min-sum approximation; parity-check node decoding; performance loss; reduced-complexity decoding; sum-product decoding; Approximation algorithms; Belief propagation; Communication standards; Digital video broadcasting; Genetic expression; Iterative algorithms; Iterative decoding; Parity check codes; Performance loss; Propagation losses; Iterative decoding; LDPC codes; reduced-complexity decoding;

fLanguage

English

Journal_Title

Circuits and Systems II: Express Briefs, IEEE Transactions on

Publisher

ieee

ISSN

1549-7747

Type

jour

DOI

10.1109/TCSII.2006.882204

Filename

1715576