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

Onderzoeksoutput: Bijdrage aan congresPaperAcademic

261 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Aantal pagina's2
StatusGepubliceerd - 27 jul. 2022
Evenement42nd WIC Symposium on Information Theory and Signal Processing in the Benelux, SITB 2022 - Louvain House, Louvain-la-Neuve, België
Duur: 1 jun. 20222 jun. 2022
Congresnummer: 42
https://sites.google.com/view/sitb2022/home

Congres

Congres42nd WIC Symposium on Information Theory and Signal Processing in the Benelux, SITB 2022
Verkorte titelSITB 2022
Land/RegioBelgië
StadLouvain-la-Neuve
Periode1/06/222/06/22
Internet adres

Vingerafdruk

Duik in de onderzoeksthema's van 'Probabilistic Constellation Shaping Algorithms: Performance vs. Complexity Trade-offs: Performance vs. Complexity Trade-offs'. Samen vormen ze een unieke vingerafdruk.

Citeer dit