Capacity-approaching protograph codes

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 determin...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2009-08, Vol.27 (6), p.876-888
Main Authors: Divsalar, D., Dolinar, S., Jones, C.R., Andrews, K.
Format: Article
Language:English
Subjects:
Asymptotic properties
Belief propagation
Bipartite graph
Blocking
Capacity planning
Construction
decoder Implementation
Decoding
Enumeration
Graphs
Iterative decoding
iterative decoding threshold
Joining processes
LDPC codes
Parity check codes
Performance analysis
Propulsion
Protograph codes
rate-compatible codes
Strategy
Thresholds
Throughput
Turbo codes
weight enumeration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2009.090806