相关论文: An Upper Bound on the Capacity of Vector Dirty Pap…
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…
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…
Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the…
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…
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…
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…
A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process and the fading channel state is known at the receiver (CSIR). This represents…
A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…
The additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is studied. This channel can be considered as an exponential version of the discrete memoryless channel with…
In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data. We first derive a tight upper bound for the capacity of this…
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…
We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity of this…
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…
Costa's "writing on dirty paper" capacity result establishes that full state pre-cancellation can be attained in Gelfand-Pinsker channel with additive state and additive Gaussian noise. The "carbon copy onto dirty paper" channel is the…
In this paper, we study the achievable performance of dirty paper coding for the Gaussian broadcast channel (BC) with finite blocklength and we propose two different achievability bounds for this problem. We present the broadcast adaptation…
In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white…
Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…
In this paper, we first consider a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$. The capacity of this channel is computed when independent noisy versions of $S$ are known to the…
An interference channel is said to have strong interference if for all input distributions, the receivers can fully decode the interference. This definition of strong interference applies to discrete memoryless, scalar and vector Gaussian…
This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…