.png){kind=icon}
.png){kind=icon}
Return
Bit-Level Probabilistically Shaped Coded Modulation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2704596.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Signal shaping
distribution matching
probabilistic shaping
coded modulation
binary mapping
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.