Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Optimum Bit-Level Distribution Matching with at most O(N3) Implementation Complexity

Not Accessible

Your library or personal account may give you access

Abstract

An algorithm of distribution matching which could be effectively implemented for short block lengths of around 100 bit or less is proposed, enabling better performance than the constant composition schemes with the same block lengths.

© 2019 The Author(s)

PDF Article
More Like This
Multi-Rate Prefix-Free Code Distribution Matching

Junho Cho and Peter J. Winzer
M4B.7 Optical Fiber Communication Conference (OFC) 2019

FPGA Implementation of Prefix-Free Code Distribution Matching for Probabilistic Constellation Shaping

Qinyang Yu, Steve Corteselli, and Junho Cho
Th1G.7 Optical Fiber Communication Conference (OFC) 2020

Simplified Bit-Level Shaping with High Spectral Efficiency and High Throughput

Yizhao Chen, Xi Chen, Ming Tang, Hexun Jiang, Yating Xiang, Tianhao Tong, Songnian Fu, and Deming Liu
M4B.5 Optical Fiber Communication Conference (OFC) 2019

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved