Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels
arXiv:1309.7543 · doi:10.1109/TIT.2014.2360692
Abstract
Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold saturation via spatial coupling. Spatially-coupled codes have been successfully applied in numerous areas. In particular, it was proven that spatially-coupled regular LDPC codes universally achieve capacity over the class of binary memoryless symmetric (BMS) channels under belief-propagation decoding. Recently, potential functions have been used to simplify threshold saturation proofs for scalar and vector recursions. In this paper, potential functions are used to prove threshold saturation for irregular LDPC and low-density generator-matrix (LDGM) codes on BMS channels, extending the simplified proof technique to BMS channels. The corresponding potential functions are closely related to the average Bethe free entropy of the ensembles in the large-system limit. These functions also appear in statistical physics when the replica method is used to analyze optimal decoding.
(v1) This article supersedes arXiv:1301.6111 (v2) Accepted to the IEEE Transactions on Information Theory
References in corpus (3)
Cited by in corpus (26)
- The Mutual Information in Random Linear Estimation
- A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions
- Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation
- Sparse Regression Codes
- Capacity-achieving Spatially Coupled Sparse Superposition Codes with AMP Decoding
- Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity
- Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
- Belief Propagation with Quantum Messages for Quantum-Enhanced Classical Communications
- The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes
- Reed-Muller Codes Achieve Capacity on Erasure Channels
- Continuous Transmission of Spatially-Coupled LDPC Code Chains
- Spatial Coupling as a Proof Technique
- Group Testing using left-and-right-regular sparse-graph codes
- Bayes-Optimal Estimation in Generalized Linear Models via Spatial Coupling
- Spatially-Coupled QLDPC Codes
- Inference and mutual information on random factor graphs
- Noisy group testing via spatial coupling
- The rank of random matrices over finite fields
- Systematic Convolutional Low Density Generator Matrix Code
- Classical Coding Approaches to Quantum Applications
- An Entropy-based Proof of Threshold Saturation for Nonbinary SC-LDPC Ensembles on the BEC
- GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories
- Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes
- Systematic Block Markov Superposition Transmission of Repetition Codes
- The Velocity of the Decoding Wave for Spatially Coupled Codes on BMS Channels
- Breaking the Computational Bottleneck: Design of Near-Optimal High-Memory Spatially-Coupled Codes