Free distance bounds for protograph-based regular LDPC convolutional codes

In this paper, asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDP...

Full description

Saved in:
Bibliographic Details
Main Authors: Mitchell, D., Pusane, A.E., Goertz, N., Costello, D.J.
Format: Conference Proceeding
Language:English
Subjects:
Artificial neural networks
Block codes
Convolutional codes
Decoding
Distance measurement
Parity check codes
Turbo codes
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.
ISSN:2165-4700
DOI:10.1109/TURBOCODING.2008.4658734