English
Related papers

Related papers: Achievable Rates for Probabilistic Shaping

200 papers

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in which constellation shaping and channel coding are combined. PAS has attracted considerable attention in both wireless and optical communications. Achievable…

Information Theory · Computer Science 2020-07-14 Yunus Can Gültekin , Alex Alvarado , Frans M. J. Willems

Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM)…

Information Theory · Computer Science 2019-02-28 Georg Böcherer , Diego Lentner , Alessandro Cirino , Fabian Steiner

Probabilistic Amplitude Shaping (PAS) is a coded-modulation scheme in which the encoder is a concatenation of a distribution matcher with a systematic Forward Error Correction (FEC) code. For reduced computational complexity the decoder can…

Information Theory · Computer Science 2018-06-05 Rana Ali Amjad

We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision…

Information Theory · Computer Science 2018-04-04 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva

Probabilistic amplitude shaping (PAS) can flexibly vary the spectral efficiency (SE) of fiber-optic systems. In this paper, we demonstrate the application of PAS to bit-wise hard decision decoding (HDD) of product codes (PCs) by finding the…

Information Theory · Computer Science 2020-08-17 Alireza Sheikh , Alexandre Graell i Amat , Alex Alvarado

A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically…

Information Theory · Computer Science 2016-05-31 Georg Böcherer

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

We introduce a trainable coded modulation scheme that enables joint optimization of the bit-wise mutual information (BMI) through probabilistic shaping, geometric shaping, bit labeling, and demapping for a specific channel model and for a…

Information Theory · Computer Science 2020-04-15 Fayçal Ait Aoudia , Jakob Hoydis

We consider probabilistic shaping to maximize the achievable information rate of coded modulation (CM) with hard decision decoding. The proposed scheme using binary staircase codes outperforms its uniform CM counterpart by more than 1.3 dB…

Information Theory · Computer Science 2017-05-08 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva

Probability Shaping (PS) is a method to improve a Modulation and Coding Scheme (MCS) in order to increase reliability of data transmission. It is already implemented in some modern radio broadcasting and optic systems, but not yet in…

Information Theory · Computer Science 2023-07-06 Evgeny Bobrov , Adyan Dordzhiev

Shaping gain is attained in schemes where a shaped subcode is chosen from a larger codebook by a codeword selection process. This includes the popular method of Trellis Shaping (TS), originally proposed by Forney for average power…

Information Theory · Computer Science 2013-08-28 Stella Achtenberg , Dan Raphaeli

A scheme is proposed that combines probabilistic signal shaping with bit-metric decoding. The transmitter generates symbols according to a distribution on the channel input alphabet. The symbols are labeled by bit strings. At the receiver,…

Information Theory · Computer Science 2014-04-22 Georg Böcherer

We generalize probabilistic amplitude shaping (PAS) with binary codes to the case of non-binary codes defined over prime finite fields. Firstly, we introduce probabilistic shaping via time sharing where shaping applies to information…

Information Theory · Computer Science 2017-01-30 Joseph J. Boutros , Fanny Jardel , Cyril Méasson

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

Information Theory · Computer Science 2015-03-17 Tadashi Wadayama , Manabu Hagiwara

We present the first neural probabilistic amplitude shaping that outperforms existing methods while accounting for all implementation losses, using a block-less, easily implementable sequential autoregressive encoder compatible with…

Machine Learning · Computer Science 2026-05-28 Mohammad Taha Askari , Lutz Lampe , Amirhossein Ghazisaeidi

Probabilistic shaping (PS) has been widely studied and applied to optical fiber communications. The encoder of PS expends the number of bit slots and controls the probability distribution of channel input symbols. Not only studies focused…

Information Theory · Computer Science 2024-01-25 Tsuyoshi Yoshida , Koji Igarashi , Magnus Karlsson , Erik Agrell

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…

Information Theory · Computer Science 2015-04-22 Hannes Bartz , Vladimir Sidorenko

The generalized linear system (GLS) has been widely used in wireless communications to evaluate the effect of nonlinear preprocessing on receiver performance. Generalized approximation message passing (AMP) is a state-of-the-art algorithm…

Information Theory · Computer Science 2023-05-16 Lei Liu , Yuhao Chi , Ying Li , Zhaoyang Zhang

On the one hand, sign-bit shaping is a popular shaping scheme where the conditional probability of the sign bit is made non-equiprobable. On the other hand, probabilistic amplitude shaping (PAS) is a popular coding scheme, to combine…

Information Theory · Computer Science 2023-03-01 Vincent Corlay , Hamidou Dembele

We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant $\varepsilon$. For a fixed-to-variable length code, we call the…

Information Theory · Computer Science 2017-10-11 Hideki Yagi , Ryo Nomura
‹ Prev 1 2 3 10 Next ›