English
Related papers

Related papers: The Carbon Copy onto Dirty Paper Channel with Stat…

200 papers

The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected…

Information Theory · Computer Science 2017-07-11 Stefano Rini , Shlomo Shamai

Costa`s "writing on dirty paper" result establishes that full state pre-cancellation can be attained in the Gel`fand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the assumptions that full…

Information Theory · Computer Science 2015-06-16 Stefano Rini , Shlomo Shamai Shitz

The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized…

Information Theory · Computer Science 2014-05-12 Stefano Rini , Shlomo Shamai

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

The "writing dirty paper" capacity result crucially dependents on the perfect channel knowledge at the transmitter as the presence of even a small uncertainty in the channel realization gravely hampers the ability of the transmitter to…

Information Theory · Computer Science 2016-02-09 Stefano Rini , Shlomo Shamai Shitz

This paper studies second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and…

Information Theory · Computer Science 2013-11-13 Jonathan Scarlett

This paper investigates the capacity of compound state-dependent channels with non-causal state information available at only the transmitter. A new lower bound on the capacity of this class of channels is derived. This bound is shown to be…

Information Theory · Computer Science 2010-04-29 Pablo Piantanida , Shlomo Shamai

The dirty paper channel (DPC) under a peak amplitude constraint arises in an optical wireless broadcast channel (BC), where the state at one receiver is the transmitted signal intended for the other receiver(s). This paper studies a class…

Information Theory · Computer Science 2023-01-09 Zhenyu Charlus Zhang , Anas Chaaban

The "Writing onto Fast Fading Dirt" (WFFD) channel is investigated to study the effects of partial channel knowledge on the capacity of the "writing on dirty paper" channel. The WFFD channel is the Gel'fand-Pinsker channel in which the…

Information Theory · Computer Science 2017-07-10 Stefano Rini , Shlomo Shamai

In this paper, we examine the effects of imperfect channel estimation at the receiver and no channel knowledge at the transmitter on the capacity of the fading Costa's channel with channel state information non-causally known at the…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Pierre Duhamel

The single-mode bosonic channel is addressed with classical interference in the modulation and with side information at the transmitter. This model can viewed as the quantum counterpart of the classical random-parameter Gaussian channel.…

Quantum Physics · Physics 2021-05-12 Uzi Pereg

This paper studies a variant of the classical problem of ``writing on dirty paper'' in which the sum of the input and the interference, or dirt, is multiplied by a random variable that models resizing, known to the decoder but not to the…

Information Theory · Computer Science 2016-11-17 Wenyi Zhang , Shivaprasad Kotagiri , J. Nicholas Laneman

In this paper, the Two-Way Channel (TWC) with Cannel State Information (CSI) is investigated. First, an achievable rate region is derived for the discrete memoryless channel. Then by extending the result to the Gaussian TWC with additive…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani

In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…

Information Theory · Computer Science 2015-07-20 Nima S. Anzabi-Nezhad , Ghosheh Abed Hodtani , Mohammad Molavi Kakhki

The impact of phase fading on the classical Costa dirty paper coding channel is studied. We consider a variation of this channel model in which the amplitude of the interference sequence is known at the transmitter while its phase is known…

Information Theory · Computer Science 2014-01-20 Stefano Rini , Shlomo Shamai

We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel,…

Information Theory · Computer Science 2007-10-14 Amir Bennatan , David Burshtein

For a discrete memoryless channel with non-causal state information available only at the encoder, it is well-known that Gelfand-Pinsker coding achieves its capacity. In this paper, we analyze Gelfand-Pinsker coding scheme and capacity to…

Information Theory · Computer Science 2010-09-06 Mai Vu

The problem of simultaneous message transmission and state amplification in a Gaussian channel with additive Gaussian state is studied when the sender has imperfect noncausal knowledge of the state sequence. Inner and outer bounds to the…

Information Theory · Computer Science 2016-11-18 Bernd Bandemer , Chao Tian , Shlomo Shamai

We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…

Quantum Physics · Physics 2016-05-04 Holger Boche , Ning Cai , Janis Nötzel

Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the…

Information Theory · Computer Science 2013-05-20 David T. H. Kao , Ashutosh Sabharwal
‹ Prev 1 2 3 10 Next ›