Constant Composition Distribution Matching
Patrick Schulte,Georg Böcherer +1 more
TLDR
Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented and the encoder achieves the maximum rate of the desired distribution, asymptotically in the blocklength.Abstract:
Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented. The encoder achieves the maximum rate, namely, the entropy of the desired distribution, asymptotically in the blocklength. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.read more
Citations
More filters
Journal ArticleDOI
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
TL;DR: A new coded modulation scheme is proposed that operates within less than 1.1 dB of the AWGN capacity 1/2 log2(1 + SNR) at any spectral efficiency between 1 and 5 bits/s/Hz by using only 5 modes.
Journal ArticleDOI
Rate Adaptation and Reach Increase by Probabilistically Shaped 64-QAM: An Experimental Demonstration
TL;DR: A transmission system with adjustable data rate for single-carrier coherent optical transmission is proposed, which enables high-speed transmission close to the Shannon limit, and it is experimentally demonstrated that the optical transmission of probabilistically shaped 64-QAM signals outperforms the transmission reach of regular 16- QAM and regular 64-ZAM signals.
Journal ArticleDOI
On Probabilistic Shaping of Quadrature Amplitude Modulation for the Nonlinear Fiber Channel
TL;DR: In this paper, the effect of using a small number of input probability mass functions (PMFs) for a range of signal-to-noise ratios (SNRs), instead of optimizing the constellation shaping for each SNR, was investigated.
Journal ArticleDOI
800G DSP ASIC Design Using Probabilistic Shaping and Digital Sub-Carrier Multiplexing
Han Sun,Mehdi Torbatian,Mehdi Karimi,Robert Maher,Sandy Thomson,Mohsen Nader Tehrani,Yuliang Gao,Ales Kumpera,George Soliman,Aditya Kakkar,Mohammad Osman,Ziad A. El-Sahn,Clayton Doggart,Weikun Hou,Shailesh Sutarwala,Yuejian Wu,Mohammad Reza Chitgarha,Vikrant Lal,Huan-Shang Tsai,Scott Corzine,Jiaming Zhang,J. Osenbach,S. Buggaveeti,Zulfikar Morbi,Miguel Iglesias Olmedo,I. Leung,Xian Xu,Parmijit Samra,Vince Dominic,Steve Sanders,Mehrdad Ziari,Antonio Napoli,Bernhard Spinnler,Kuang-Tsan Wu,Parthiban Kandappan +34 more
TL;DR: This manuscript discusses the motivations for jointly utilizing transmission techniques such as probabilistic shaping and digital sub-carrier multiplexing in digital coherent optical transmissions systems and describes the key-building blocks of modern high-speed DSP-based transponders working at up to 800G per wave.
Journal ArticleDOI
Field and lab experimental demonstration of nonlinear impairment compensation using neural networks
Shaoliang Zhang,Fatih Yaman,Kohei Nakamura,Takanori Inoue,Valey Kamalov,Ljupcho Jovanovski,Vijay Vusirikala,Eduardo Mateo,Yoshihisa Inada,Ting Wang +9 more
TL;DR: A single-step, system agnostic nonlinearity compensation algorithm based on a neural network is proposed to pre-distort symbols at transmitter side to demonstrate ~0.6 dB Q improvement after 2800 km standard single-mode fiber transmission using 32 Gbaud signal.
References
More filters
Journal ArticleDOI
Good error-correcting codes based on very sparse matrices
TL;DR: It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
Book
Introduction to data compression
TL;DR: The author explains the development of the Huffman Coding Algorithm and some of the techniques used in its implementation, as well as some of its applications, including Image Compression, which is based on the JBIG standard.
Book
Information Theory and Statistics: A Tutorial
I. Csiszar,Paul C. Shields +1 more
TL;DR: This tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting, and an introduction is provided to the theory of universal coding, and to statistical inference via the minimum description length principle motivated by that theory.
Journal ArticleDOI
Efficient Modulation for Band-Limited Channels
TL;DR: This paper attempts to present a comprehensive tutorial survey of the development of efficient modulation techniques for bandlimited channels, such as telephone channels, with principal emphasis on coded modulation techniques, in which there is an explosion of current interest.