English
Related papers

Related papers: Probabilistic Signal Shaping for Bit-Metric Decodi…

200 papers

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

Hierarchical modulation (HM) is able to provide different levels of protection for data streams and achieve a rate region that cannot be realized by traditional orthogonal schemes, such as time division (TD). Nevertheless, criterions and…

Information Theory · Computer Science 2016-10-19 Baicen Xiao , Kexin Xiao , Zhiyong Chen , Hui Liu

This paper introduces a random modulation technique that is decoupled from the channel matrix, allowing it to be applied to arbitrary norm-bounded and spectrally convergent channel matrices. The proposed random modulation constructs an…

Information Theory · Computer Science 2026-01-01 Lei Liu , Yuhao Chi , Shunqi Huang

This paper investigates a joint source-channel secrecy problem for the Shannon cipher broadcast system. We suppose list secrecy is applied, i.e., a wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

Information Theory · Computer Science 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen

We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…

Information Theory · Computer Science 2009-05-18 Christian Senger , Vladimir Sidorenko , Victor Zyablov

The implementation difficulties of combining distribution matching (DM) and dematching (invDM) for probabilistic shaping (PS) with soft-decision forward error correction (FEC) coding can be relaxed by reverse concatenation, for which the…

Signal Processing · Electrical Eng. & Systems 2024-01-25 Tsuyoshi Yoshida , Magnus Karlsson , Erik Agrell

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does…

Information Theory · Computer Science 2013-03-26 Alex Alvarado , Leszek Szczecinski , Erik Agrell

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude…

Quantum Physics · Physics 2009-11-10 Fengli Yan , Meiyu Wang

A new geometric shaping technique, referred to as coset shaping, is proposed and analyzed for coded QAM and PAM signaling. This method can be applied to both information and parity bits without introducing additional complexity. It is shown…

Information Theory · Computer Science 2026-03-30 Irina Bocharova , Maiara F. Bollauf , Boris Kudryashov

The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the…

Information Theory · Computer Science 2016-03-24 Qian Yu

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

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…

Information Theory · Computer Science 2017-03-20 Mostafa Khoshnevisan , J Nicholas Laneman

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are…

Information Theory · Computer Science 2020-02-27 Min Ye , Emmanuel Abbe

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

Deep learning-based joint source-channel coding (JSCC) is emerging as a potential technology to meet the demand for effective data transmission, particularly for image transmission. Nevertheless, most existing advancements only consider…

Signal Processing · Electrical Eng. & Systems 2024-06-18 Pujing Yang , Guangyi Zhang , Yunlong Cai

Continuous phase modulation (CPM) with 1-bit quantization at the receiver is promising in terms of energy and spectral efficiency. In this study, CPM waveforms with symbol durations significantly shorter than the inverse of the signal…

Information Theory · Computer Science 2019-10-16 Rodrigo R. M. de Alencar , Lukas T. N. Landau

We consider communication over the block noncoherent AWGN channel with low-precision Analog-to-Digital Converters (ADCs) at the receiver. For standard uniform Phase Shift Keying (PSK) modulation, we investigate the performance of a receiver…

Information Theory · Computer Science 2009-05-28 Jaspreet Singh , Upamanyu Madhow

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

In the wideband regime, the performance of many of the popular modulation schemes such as code division multiple access and orthogonal frequency division multiplexing falls quickly without channel state information. Obtaining the amount of…

Information Theory · Computer Science 2022-06-01 Kathleen Yang , Salman Salamatian , Rafael G. L . D'Oliveira , Muriel Medard
‹ Prev 1 8 9 10 Next ›