On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding

2025/07/09 by Peng, Qingqing, Chang, Dongxu, Wang, Guanghui +1
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2507.06635

Abstract

It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show that information can propagate in a wave-like manner at a constant speed under WD. Additionally, we provide an upper bound for the information propagation speed on the binary erasure channel, which can assist in designing the number of iterations required within each window.

Citations

• Comparison of Windowed-Decoder Configurations for Spatially Coupled LDPC Codes Under Equal-Complexity Constraints
• Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes
• On the Convergence Speed of Spatially Coupled LDPC Ensembles
• A Proof of Threshold Saturation for Spatially-Coupled LDPC Codes on BMS\n Channels
• Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems
• A Simple Proof of Threshold Saturation for Coupled Vector Recursions
• A Simple Proof of Threshold Saturation for Coupled Scalar Recursions
• Spatially Coupled Ensembles Universally Achieve Capacity under Belief\n Propagation
• Windowed Decoding of Spatially Coupled Codes
• Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity
• Threshold Saturation on BMS Channels via Spatial Coupling

Related

• On the Convergence Speed of Spatially Coupled LDPC Ensembles
• Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes
• Comparison of Windowed-Decoder Configurations for Spatially Coupled LDPC Codes Under Equal-Complexity Constraints
• Windowed Decoding of Spatially Coupled Codes
• Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC\n Codes