Bit-Level Probabilistically Shaped Coded Modulation

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 matchings with binary output alphabets, and then maps the binary output streams to symbols from the primary, non-binary...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 21; no. 9; pp. 1929 - 1932
Main Authors Pikus, Marcin, Wen Xu
Format Journal Article
LanguageEnglish
Published IEEE 01.09.2017
Subjects
AWGN channels
binary mapping
coded modulation
distribution matching
Impedance matching
Optical transmitters
Probabilistic logic
probabilistic shaping
Quadrature amplitude modulation
Signal shaping
Systematics
Online AccessGet full text

Cover

More Information
Summary: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 matchings with binary output alphabets, and then maps the binary output streams to symbols from the primary, non-binary alphabet. Fixed length distribution matching is essential for probabilistically shaped coded modulation (PSCM), such as the probabilistic amplitude shaping (PAS). In the PAS setup, the novel bit-level distribution matcher achieves similar rate-versus-SNR performance as the symbol-level constant composition distribution matcher, thus providing a high throughput solution for PSCM.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2704596