Probabilistic Constellation Shaping Algorithms: Performance vs. Complexity Trade-offs: Performance vs. Complexity Trade-offs

Research output: Contribution to conferencePaperAcademic

266 Downloads (Pure)

Abstract

We review the recent advances in the design of probabilistic shaping algorithms. We investigate the implementation complexity of these algorithms in terms of required storage and computational power. We show that (1) the optimum performance can be achieved via different algorithms creating a trade-off between storage and computational complexities, and (2) a significant reduction in complexity can be achieved via the recently-proposed shift-based band-trellis enumerative sphere shaping if a slight degradation in performance is tolerated.
Original languageEnglish
Number of pages2
Publication statusPublished - 27 Jul 2022
Event42nd WIC Symposium on Information Theory and Signal Processing in the Benelux, SITB 2022 - Louvain House, Louvain-la-Neuve, Belgium
Duration: 1 Jun 20222 Jun 2022
Conference number: 42
https://sites.google.com/view/sitb2022/home

Conference

Conference42nd WIC Symposium on Information Theory and Signal Processing in the Benelux, SITB 2022
Abbreviated titleSITB 2022
Country/TerritoryBelgium
CityLouvain-la-Neuve
Period1/06/222/06/22
Internet address

Fingerprint

Dive into the research topics of 'Probabilistic Constellation Shaping Algorithms: Performance vs. Complexity Trade-offs: Performance vs. Complexity Trade-offs'. Together they form a unique fingerprint.

Cite this