24 research outputs found
On Capacity of the Dirty Paper Channel with Fading Dirt in the Strong Fading Regime
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 assumption that perfect channel knowledge is available at both
transmitter and receiver. While channel knowledge at the receiver can be
obtained through pilot tones, transmitter channel knowledge is harder to
acquire. For this reason, we are interested in characterizing the capacity
under the more realistic assumption that only partial channel knowledge is
available at the transmitter. We study, more specifically, the dirty paper
channel in which the interference sequence in multiplied by fading value
unknown to the transmitter but known at the receiver. For this model, we
establish an approximate characterization of capacity for the case in which
fading values vary greatly in between channel realizations. In this regime,
which we term the strong fading regime, the capacity pre-log factor is equal to
the inverse of the number of possible fading realizations
Channel with States at the Source
We consider a state-dependent three-terminal full-duplex relay channel with the channel states noncausally available at only the source, that is, neither at the relay nor at the destination. This model has application to cooperation over certain wireless channels with asymmetric cognition capabilities and cognitive interference relay channels. We establish lower bounds on the channel capacity for both discrete memoryless (DM) and Gaussian cases. For the DM case, the coding scheme for the lower bound uses techniques of rate-splitting at the source, decode-and-forward (DF) relaying, and a Gel'fand-Pinsker-like binning scheme. In this coding scheme, the relay decodes only partially the information sent by the source. Due to the rate-splitting, this lower bound is better than the one obtained by assuming that the relay decodes all the information from the source, that is, full-DF. For the Gaussian case, we consider channel models in which each of the relay node and the destination node experiences on its link an additive Gaussian outside interference. We first focus on the case in which the links to the relay and to the destination are corrupted by the same interference; and then we focus on the case of independent interferences. We also discuss a model with correlated interferences. For each of the first two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decode-and-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn
On the Dirty Paper Channel with Fast Fading Dirt
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 channel knowledge is available at both the transmitter
and the receiver. In this work we consider the scenario in which the state is
multiplied by an ergodic fading process which is not known at the encoder. We
study both the case in which the receiver has knowledge of the fading and the
case in which it does not: for both models we derive inner and outer bounds to
capacity and determine the distance between the two bounds when possible. For
the channel without fading knowledge at either the transmitter or the receiver,
the gap between inner and outer bounds is finite for a class of fading
distributions which includes a number of canonical fading models. In the
capacity approaching strategy for this class, the transmitter performs Costa`s
pre-coding against the mean value of the fading times the state while the
receiver treats the remaining signal as noise. For the case in which only the
receiver has knowledge of the fading, we determine a finite gap between inner
and outer bounds for two classes of discrete fading distribution. The first
class of distributions is the one in which there exists a probability mass
larger than one half while the second class is the one in which the fading is
uniformly distributed over values that are exponentially spaced apart.
Unfortunately, the capacity in the case of a continuous fading distribution
remains very hard to characterize