Shell Mapping for Distribution matching

03/09/2018
by   Patrick Schulte, et al.
0

Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution PA. Fixed-to-fixed length, invertible encoders and decoders based on shell mapping are presented. The matcher minimizes the informational divergence for a large class of distributions including the Maxwell-Boltzmann and geometric distributions. Finite length simulations show performance gains of up to 0.6 dB as compared to a constant composition distribution matching for short matcher output lengths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2019

Arithmetic Coding Based Multi-Composition Codes for Bit-Level Distribution Matching

A distribution matcher (DM) encodes a binary input data sequence into a ...
research
07/28/2019

Finite-Precision Implementation of Arithmetic Coding Based Distribution Matchers

A distribution matcher (DM) encodes a binary input data sequence into a ...
research
05/02/2021

Divergence Scaling for Distribution Matching

Distribution matchers for finite alphabets are shown to have information...
research
10/20/2020

Invertible Low-Divergence Coding

Several applications in communication, control, and learning require app...
research
06/12/2020

Analysis of Nonlinear Fiber Interactions for Finite-Length Constant-Composition Sequences

In order to realize probabilistically shaped signaling within the probab...
research
06/12/2020

Huffman-coded Sphere Shaping and Distribution Matching Algorithms via Lookup Tables

In this paper, we study amplitude shaping schemes for the probabilistic ...
research
03/29/2023

Boltzmann Distribution on "Short” Integer Partitions with Power Parts: Limit Laws and Sampling

The paper is concerned with the asymptotic analysis of a family of Boltz...

Please sign up or login with your details

Forgot password? Click here to reset