Constellation Shaping for Bit-Interleaved LDPC Coded APSK
Matthew C. Valenti, Xingyu Xiang

TL;DR
This paper introduces a novel energy-efficient constellation shaping method for LDPC-coded APSK systems, optimizing bit probabilities and decoding strategies to improve performance over AWGN channels.
Contribution
It proposes a new constellation shaping technique combined with degree-distribution optimization and iterative decoding for LDPC-coded APSK, achieving over 1 dB gain.
Findings
Achieves over 1 dB gain in AWGN at 3 bits/symbol.
Optimizes LDPC degree distributions for shaped APSK.
Demonstrates effectiveness of iterative decoding with shaping.
Abstract
An energy-efficient approach is presented for shaping a bit-interleaved low-density parity-check (LDPC) coded amplitude phase-shift keying (APSK) system. A subset of the interleaved bits output by a binary LDPC encoder are passed through a nonlinear shaping encoder whose output is more likely to be a zero than a one. The "shaping" bits are used to select from among a plurality of subconstellations, while the unshaped bits are used to select the symbol within the subconstellation. Because the shaping bits are biased, symbols from lower-energy subconstellations are selected more frequently than those from higher-energy subconstellations. An iterative decoder shares information among the LDPC decoder, APSK demapper, and shaping decoder. Information rates are computed for a discrete set of APSK ring radii and shaping bit probabilities, and the optimal combination of these parameters is…
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.
