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 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-versusSNR performance as the symbol-level constant composition distribution matcher, thus providing a high throughput solution for PSCM.