Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes
Diego Lentner, Thomas Wiegart, Richard D. Wesel

TL;DR
This paper introduces an efficient method for shaping parity bits in IRA LDPC codes, improving communication performance over AWGN channels by up to 0.9 dB compared to uniform signaling.
Contribution
It proposes a novel probabilistic parity shaping algorithm tailored for IRA LDPC codes that enhances their efficiency and performance.
Findings
Achieves up to 0.9 dB gain over uniform signaling
Efficient shaping of parity bits following the accumulator's encoding order
Improves performance in AWGN channels with on-off keying
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.
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.
