Iterative decoding threshold analysis for LDPC convolutional codes

Authors:
Michael Lentmaier;Arvind Sridharan;Daniel J. Costello;Kamil Sh. Zigangirov
Affiliations:
Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Seagate Technologies, Longmont, CO and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN and Lund University, Lund, Sweden and the Institute for Problems of Information Transmission, Moscow, Russia
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 13
Cited 0

Practical loss-resilient codes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
To the Theory of Low-Density Convolutional Codes. II

Problems of Information Transmission
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Problems of Information Transmission
On universal properties of capacity-approaching LDPC code ensembles

IEEE Transactions on Information Theory
Time-varying periodic convolutional codes with low-density parity-check matrix

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Capacity-achieving sequences for the erasure channel

IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices

IEEE Transactions on Information Theory
An analysis of the block error probability performance of iterative decoding

IEEE Transactions on Information Theory
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

IEEE Transactions on Information Theory
Distance Bounds for an Ensemble of LDPC Convolutional Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

An iterative decoding threshold analysis for terminated regnlar LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregnlar LDPC block codes.