Construction of Near-Capacity Protograph LDPC Code Sequences with Block-Error Thresholds
arXiv:1510.06828 · doi:10.1109/TCOMM.2015.2500234
Abstract
Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and noise level is below threshold. Conditions for stability of protograph density evolution are established and related to the structure of the protograph. Using large-girth graphs, sequences of protograph LDPC codes with block-error threshold equal to bit-error threshold and block-error rate falling near-exponentially with blocklength are constructed deterministically. Small-sized protographs are optimized to obtain thresholds near capacity for binary erasure and binary-input Gaussian channels.
to appear in the IEEE Transactions on Communications
References in corpus (5)
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC
- Spatially Coupled LDPC Codes Constructed from Protographs
- Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes
- Regular graphs of large girth and arbitrary degree
- Terminated and Tailbiting Spatially-Coupled Codes with Optimized Bit Mappings for Spectrally Efficient Fiber-Optical Systems