Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes
Information Theory
2025-08-28 v1 math.IT
Abstract
Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive white Gaussian noise (AWGN) channels with on-off keying show a gain of up to 0.9 dB over uniform signaling.
Cite
@article{arxiv.2508.19696,
title = {Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes},
author = {Diego Lentner and Thomas Wiegart and Richard D. Wesel},
journal= {arXiv preprint arXiv:2508.19696},
year = {2025}
}
Comments
Presented at the 2025 International Symposium on Topics in Coding