Achievable Rates for Probabilistic Shaping

2017/07/04 by Georg Böcherer, Böcherer, Georg · 3 citations
Computer Science · Decision Sciences · Mathematics · #Cellular Automata and Applications #FOS: Computer and information sciences #Generative Adversarial Networks and Image Synthesis #Information Theory (cs.IT) #Probabilistic and Robust Engineering Design #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1707.01134

Compared to v4, a simpler proof of Proposition 1 (achievable encoding rate) is given and an interpretation of the uncertainty as a cross-entropy is added

openalex publication_date 2017/07/04 · arxiv created 2018/05/22 · arxiv updated 2018/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a layered probabilistic shaping (PS) scheme with a general decoding metric, an achievable rate is derived using Gallager's error exponent approach and the concept of achievable code rates is introduced. Several instances for specific decoding metrics are discussed, including bit-metric decoding, interleaved coded modulation, and hard-decision decoding. It is shown that important previously known achievable rates can also be achieved by layered PS. A practical instance of layered PS is the recently proposed probabilistic amplitude shaping (PAS).

Cited by

• Rate-Adaptive Protograph-Based MacKay-Neal Codes
• Efficient Deep Neural Receiver with Post-Training Quantization
• End-to-End Learning of Probabilistic Constellation Shaping through Importance Sampling

Related

• Information Rates and Error Exponents for Probabilistic Amplitude Shaping
• Probabilistic Parity Shaping for Linear Codes
• Probabilistic Signal Shaping for Bit-Metric Decoding
• Achievable Rates for Shaped Bit-Metric Decoding
• Probabilistically-Shaped Coded Modulation with Hard Decision Decoding for Coherent Optical Systems