Capacity-approaching protograph codes

Authors:
Dariush Divsalar;Sam Dolinar;Christopher R. Jones;Kenneth Andrews
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;Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Year:
2009

Citing 16
Cited 0

On the construction of some capacity-approaching coding schemes

On the construction of some capacity-approaching coding schemes
Approximate-min* constraint node updating for LDPC code decoding

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Iterative decoding of binary block and convolutional codes

IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses construction of protograph-based low-density parity-check (LDPC) codes. Emphasis is placed on protograph ensembles whose typical minimum distance grows linearly with block size. Asymptotic performance analysis for both weight enumeration and iterative decoding threshold determination is provided and applied to a series of code constructions. Construction techniques that yield both low thresholds and linear minimum distance growth are introduced by way of example throughout. The paper also examines implementation strategies for high throughput decoding derived from first principles of belief propagation on bipartite graphs.