Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes

Low-Density Parity-Check (LDPC) convolutional codes have been shown to be capable of achieving capacity approaching performance with iterative message-passing decoding. In the first part of this paper, using asymptotic methods to obtain lower bounds on the free distance to constraint length ratio, the authors show that several ensembles of regular and irregular LDPC convolutional codes derived from photograph-based LDPC block codes have the property that the free distance grows linearly with respect to the constraint length, i.e., the ensembles are asymptotically good. In particular, they show that the free distance to constraint length ratio of the LDPC convolutional code ensembles exceeds the minimum distance to block length ratio of the corresponding LDPC block code ensembles.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Aug 2011 Format: PDF

Find By Topic