On the Gap to Channel Capacity of Generalized Low-Density Parity-Check Codes
Open Access
- 3 March 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 1780-1793
Abstract
In this study, the gap to channel capacity of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder on the binary input additive white Gaussian noise (BI-AWGN) channel is analyzed. Building on the density evolution for LDPC codes, we extend this to GLDPC codes by generalizing the properties of concentration, symmetry, and monotonicity to accommodate the characteristics of GLDPC codes. Specifically, we propose a methodology to simplify the computation of density evolution for GLDPC codes under APP decoding over BI-AWGN channels. Firstly, we identify a class of subcodes that can greatly simplify the performance analysis and practical decoding of GLDPC codes, which we refer to as message-invariant subcodes. Secondly, based on the characteristics of GLDPC codes, we develop a Gaussian mixture approximation algorithm to approximate the message distributions in density evolution. Compared to Gaussian approximation, the proposed Gaussian mixture approximation approach can greatly enhance accuracy while maintaining low computational complexity. Based on the above techniques, we demonstrate that with an appropriate proportion of generalized constraint (GC) nodes, despite the rate loss when single parity-check (SPC) nodes are replaced by GC nodes, GLDPC codes can reduce the original gap to capacity compared to their original LDPC counterparts. Our simulation experiments validate the performance analysis.Keywords
Funding Information
- National Key Research and Development Program of China (2023YFA1009600)
This publication has 24 references indexed in Scilit:
- Improved EXIT Algorithm Based on Gaussian Mixture Model and its Application to LDPC Construction in Coding Cooperative Systems With Hybrid FadingIEEE Access, 2020
- Design of LDPC code ensembles with fast convergence properties2015
- Modern Coding Theory2008
- Generalized low density (Tanner) codes2003
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- On generalized low-density parity-check codes based on Hamming component codesIEEE Communications Letters, 1999
- A simple one-sweep algorithm for optimal APP symbol decoding of linear block codesIEEE Transactions on Information Theory, 1998
- On the BCJR trellis for linear block codesIEEE Transactions on Information Theory, 1996