Protograph LDPC codes over burst erasure channels

Authors:
Dariush Divsalar;Sam Dolinar;Christopher Jones
Affiliations:
Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA;Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA;Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 12
Cited 1

Improved low-density parity-check codes using irregular graphs

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
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
On ensembles of low-density parity-check codes: asymptotic distance distributions

IEEE Transactions on Information Theory
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders

IEEE Transactions on Information Theory
Distance distributions in ensembles of irregular low-density parity-check codes

IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes

IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles

IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory
Codes defined on graphs

IEEE Communications Magazine
The renaissance of Gallager's low-density parity-check codes

IEEE Communications Magazine

Construction of near-optimum burst erasure correcting low-density parity-check codes

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class. A scheme is proposed to use these LDPC codes over burst erasure channels. The proposed encoding method is also applicable to cases when packets are frequency hopped over channels with partial band jamming or frequency selective fading. Various LDPC codes are compared and simulation results are provided.