pith. sign in

arxiv: 1902.10648 · v1 · pith:GO3Y4PHEnew · submitted 2019-02-27 · 💻 cs.IT · math.IT

Probabilistic Parity Shaping for Linear Codes

classification 💻 cs.IT math.IT
keywords linearllpsbitsparityprobabilisticshapingcodecodes
0
0 comments X
read the original abstract

Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM) maps information bits to shaped bits, which are then systematically encoded by appending uniformly distributed parity bits. LLPS extends PAS by probabilistic parity shaping (PPS), which uses a syndrome DM to calculate shaped parity bits. LLPS enables the transmission with any desired distribution using linear codes, furthermore, by LLPS, a given linear code with rate $R_\text{fec}$ can be operated at any rate $R\leq R_\text{fec}$ by changing the distribution. LLPS is used with an LDPC code for dirty paper coding against an interfering BPSK signal, improving the energy efficiency by 0.8 dB.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Shaped On-Off Keying Using Polar Codes

    cs.IT 2019-07 unverdicted novelty 6.0

    Polar codes perform joint distribution matching and error correction for on-off keying, delivering asymptotically optimal signaling and a simulated 1.8 dB gain over uniform transmission at 0.25 bits per channel use.