Improved construction of irregular progressive edge-growth Tanner graphs
Jesus Martinez-Mateo, David Elkouss, Vicente Martin
TL;DR
This paper introduces a modified progressive edge-growth algorithm that enhances the construction of irregular LDPC codes, leading to better performance in the waterfall region especially for complex degree distributions.
Contribution
A novel modification to the progressive edge-growth algorithm that improves irregular LDPC code construction for complex degree distributions.
Findings
Enhanced code performance in the waterfall region
Effective for irregular codes with complex degree distributions
Improved construction process for LDPC codes
Abstract
The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions. The proposed algorithm is thus interesting if a family of irregular codes with a complex check node degree distribution is used.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.