Protograph doubly-generalized low-density parity-check (DGLDPC) codes, which allow for arbitrary component codes at the variable and check nodes of a protograph, are considered. Exact density evolution is derived over the binary erasure channel. Conditions on the protograph and component codes to ensure equality of block-error threshold and density evolution threshold for large-girth ensembles are established. Conditions for stability of density evolution are derived, and block-error threshold property is extended to binary-input symmetric channels. Optimized low-rate protographs for DGLDPC codes over the erasure channel are presented. © 2016 IEEE.

Andrew Edwin Thangaraj

Department of Electrical Engineering

Bins

Convolutional codes

Information theory

Satellite communication systems

Binary erasure channel

BINARY INPUTS

BLOCK ERRORS

COMPONENT CODES

Density evolution

Erasure channels

LOW DENSITY PARITY CHECK

SYMMETRIC CHANNELS

Codes (symbols)

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

Near-capacity protograph doubly-generalized LDPC codes with block thresholds

IEEE International Symposium on Information Theory - Proceedings

Density evolution for protograph low-density paritycheck (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and noise level is below threshold. Conditions for stability of protograph density evolution are established and related to the structure of the protograph. Using large-girth graphs, sequences of protograph LDPC codes with block-error threshold equal to bit-error threshold and block-error rate falling near-exponentially with blocklength are constructed deterministically. Small-sized protographs are optimized to obtain thresholds near capacity for binary erasure and binary-input Gaussian channels. © 2015 IEEE.

Fulltext

IEEE Transactions on Communications

Construction of near-capacity protograph LDPC code sequences with block-error thresholds

IEEE Transactions on Information Theory

Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes

Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel

2009 IEEE International Symposium on Information Theory

Exact erasure channel density evolution for protograph-based generalized LDPC codes

Doubly Generalized LDPC Codes over the AWGN Channel

Journal	Data powered by TypesetIEEE International Symposium on Information Theory - Proceedings
Publisher	Data powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN	21578095
Open Access	No