Achievable Rates for Probabilistic Shaping

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).

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

Cited by in corpus (15)

• Hierarchical Distribution Matching for Probabilistically Shaped Coded Modulation
• Probabilistic Amplitude Shaping with Hard Decision Decoding and Staircase Codes
• Bit-Metric Decoding of Non-Binary LDPC Codes with Probabilistic Amplitude Shaping
• Probabilistic Eigenvalue Shaping for Nonlinear Fourier Transform Transmission
• Experimental Verification of Rate Flexibility and Probabilistic Shaping by 4D Signaling
• Post-FEC BER Benchmarking for Bit-Interleaved Coded Modulation with Probabilistic Shaping
• Achievable Information Rates for Probabilistic Amplitude Shaping: An Alternative Approach via Random Sign-Coding Arguments
• On Product Codes with Probabilistic Amplitude Shaping for High-Throughput Fiber-Optic Systems
• Performance Monitoring for Live Systems with Soft FEC and Multilevel Modulation
• Performance Metrics for Communication Systems with Forward Error Correction
• Information Rates and Error Exponents for Probabilistic Amplitude Shaping
• Learning OFDM Waveforms with PAPR and ACLR Constraints
• Partially Ordered Statistics Demapping for Multi-Dimensional Modulation Formats
• Rate-Adaptive Protograph-Based MacKay-Neal Codes
• Finite-Support Capacity-Approaching Distributions for AWGN Channels