TL;DR
This paper introduces a new density evolution approximation method for LDPC and MET-LDPC codes that improves accuracy and reduces computational time for code threshold estimation, especially at low rates and with punctured nodes.
Contribution
A novel hybrid density evolution approximation combining full density evolution and Gaussian assumptions, enhancing accuracy and efficiency in code threshold analysis.
Findings
The new method outperforms existing Gaussian approximations in accuracy.
It significantly reduces computational time for threshold evaluation.
The approach is particularly effective at low code rates and with punctured nodes.
Abstract
This paper considers density evolution for lowdensity parity-check (LDPC) and multi-edge type low-density parity-check (MET-LDPC) codes over the binary input additive white Gaussian noise channel. We first analyze three singleparameter Gaussian approximations for density evolution and discuss their accuracy under several conditions, namely at low rates, with punctured and degree-one variable nodes. We observe that the assumption of symmetric Gaussian distribution for the density-evolution messages is not accurate in the early decoding iterations, particularly at low rates and with punctured variable nodes. Thus single-parameter Gaussian approximation methods produce very poor results in these cases. Based on these observations, we then introduce a new density evolution approximation algorithm for LDPC and MET-LDPC codes. Our method is a combination of full density evolution and a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
