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

Authors:
Michael Lentmaier;Marcos B. S. Tavares;Gerhard P. Fettweis
Affiliations:
Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany;Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany;Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 8
Cited 0

Practical loss-resilient codes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Doubly-generalized LDPC codes: stability bound over the BEC

IEEE Transactions on Information Theory
On the information function of an error-correcting code

IEEE Transactions on Information Theory
A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes

IEEE Transactions on Information Theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders

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

IEEE Transactions on Information Theory
On a technique to calculate the exact performance of a convolutional code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive explicit density evolution equations for protograph-based generalized LDPC codes on the binary erasure channel. They are obtained from an analysis of multi-dimensional input/output transfer functions of the component decoders. Belief propagation decoding with optimal component APP decoders is considered. Based on the resulting transfer functions, a threshold analysis is performed for some protograph examples.