The hierarchical distribution matching (Hi-DM) approach for probabilistic shaping is described. The potential of Hi-DM in terms of trade-off between performance, complexity, and memory is illustrated through three case studies.
© 2020 The Author(s)
You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
Login to access OSA Member Subscription