On a class of doubly-generalized LDPC codes with single parity-check variable nodes

Authors:
Enrico Paolini;Mark F. Flanagan;Marco Chiani;Marc P. C. Fossorier
Affiliations:
DEIS, WiLAB, University of Bologna, Cesena, FC, Italy;School of Electrical, Electronic and Mechanical Engineering, University College Dublin, Belfield, Dublin 4, Ireland and Institut für Mathematik, University of Zürich;DEIS, WiLAB, University of Bologna, Cesena, FC, Italy;ETIS, ENSEA, UCP, CNRS UMR, Cergy Pontoise, France
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 5
Cited 1

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Doubly-generalized LDPC codes: stability bound over the BEC

IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes

IEEE Transactions on Information Theory

Growth rate of the weight distribution of doubly-generalized LDPC codes: general case and efficient evaluation

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC ensem ble with a uniform check node (CN) set is presented at first, together with an analytical technique for its efficient evaluation. These tools are then used for detailed analysis of a case study, namely, a rate-1/2 D-GLDPC ensemble where all the CNs are (7,4) Hamming codes and all the VNs are length-7 SPC codes. It is illustrated how the VN representations can heavily affect the code properties and how different VN representations can be combined within the same graph to enhance some of the code parameters. The analysis is conducted over the binary erasure channel. Interesting features of the new codes include the capability of achieving a good compromise between waterfall and error floor performance while preserving graphical regularity, and values of threshold outperforming LDPC counterparts.