Huffman-coded Sphere Shaping and Distribution Matching Algorithms via Lookup Tables
arXiv:2006.07045 · doi:10.1109/JLT.2020.2987210
Abstract
In this paper, we study amplitude shaping schemes for the probabilistic amplitude shaping (PAS) framework as well as algorithms for constant-composition distribution matching (CCDM). Huffman-coded sphere shaping (HCSS) is discussed in detail, which internally uses Huffman coding to determine the composition to be used and relies on conventional CCDM algorithms for mapping and demapping. Numerical simulations show that HCSS closes the performance gap between distribution matching schemes and sphere shaping techniques such as enumerative sphere shaping (ESS). HCSS is based on an architecture that is different from the trellis-based setup of ESS. It allows to tailor the used HCSS compositions to the transmission channel and to take into account complexity constraints. We further discuss in detail multiset ranking (MR) and subset ranking (SR) as alternatives to arithmetic-coding (AC) CCDM. The advantage of MR over AC is that it requires less sequential operations for mapping. SR operates on binary alphabets only, which can introduce some additional rate loss when a nonbinary-to-binary transformation is required. However, the binomial coefficients required for SR can be precomputed and stored in a lookup table (LUT). We perform an analysis of rate loss and decoding performance for the proposed techniques and compare them to other prominent amplitude shaping schemes. For medium to long block lengths, MR-HCSS and SR-HCSS are shown to have similar performance to ESS. SR-HCSS and uniform 64QAM are compared in additive white Gaussian noise simulations and shaping gains of 0.5 dB and 1 dB are demonstrated with 1 kbit and 100 kbit LUT size, respectively.
The work has been partially funded by the German Ministry of Education and Research in the project PEARLS (contract #13N14937)
References in corpus (13)
- On Probabilistic Shaping of Quadrature Amplitude Modulation for the Nonlinear Fiber Channel
- Enumerative Sphere Shaping for Wireless Communications with Short Packets
- Hierarchical Distribution Matching for Probabilistically Shaped Coded Modulation
- LDPC Coded Modulation with Probabilistic Shaping for Optical Fiber Systems
- Sensitivity Gains by Mismatched Probabilistic Shaping for Optical Communication Systems
- A Pragmatic Coded Modulation Scheme for High-Spectral-Efficiency Fiber-Optic Communications
- Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping
- Experimental Comparison of Probabilistic Shaping Methods for Unrepeated Fiber Transmission
- Analysis of Nonlinear Fiber Interactions for Finite-Length Constant-Composition Sequences
- Laser Phase Noise Tolerance of Uniform and Probabilistically-shaped QAM Signals for High Spectral Efficiency Systems
- A Simple Nonlinearity-Tailored Probabilistic Shaping Distribution for Square QAM
- Mitigating Fiber Nonlinearities by Short-length Probabilistic Shaping
- High Throughput Probabilistic Shaping with Product Distribution Matching