Abstract

A general distribution matching architecture based on a multi-level structure is presented. It allows to generate arbitrary symbol distributions using simple binary distribution matchers. This is particularly advantageous for large symbol alphabets, where non-binary distribution matching algorithms tend to have high complexity. Some examples for possible implementations are provided, and a specific realization based on polar codes, which enables joint shaping and channel coding for reliable data transmission with higher-order modulation, is discussed and evaluated in detail.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call