In this paper, we provide a systematic comparison of distribution matching (DM) and sphere
shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For …

Product distribution matching (PDM) is proposed to generate target distributions over large
alphabets by combining the output of several parallel distribution matchers (DMs) with …

Probabilistic amplitude shaping (PAS) proposed in Böcherer, Steiner, Schulte [24] is a
practical architecture for combining non-uniform distributions on higher-order constellations …

Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit
sequence to shaped amplitudes and plays an important role in the probabilistic amplitude …

In this paper, we construct variable-length prefix-free codes that are optimal (or near-
optimal) in the sense that no (or few) other codes of the same cardinality can achieve a …

A routine to parallelize and increase the throughput of fixed length distribution matching with
non-binary output alphabet is presented. The routine performs parallel distribution …

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 …

The performance of different probabilistic amplitude shaping (PAS) techniques in the
nonlinear regime is investigated, highlighting its dependence on the PAS block length and …

Gaussian channel inputs are required to achieve the capacity of additive white Gaussian
noise (AWGN) channels. Equivalently, the n-dimensional constellation boundary must be an …

Distribution matching (DM) transforms independent and Bernoulli (1/2) distributed bits into a
sequence of output symbols with a desired distribution. A fixed-to-fixed length, invertible DM …