English

On the Capacity Equivalence with Side Information at Transmitter and Receiver

Information Theory 2008-06-18 v2 math.IT

Abstract

In this paper, a channel that is contaminated by two independent Gaussian noises S N(0,Q)S ~ N(0,Q) and Z0 N(0,N0)Z_0 ~ N(0,N_0) is considered. The capacity of this channel is computed when independent noisy versions of SS are known to the transmitter and/or receiver. It is shown that the channel capacity is greater then the capacity when SS is completely unknown, but is less then the capacity when SS is perfectly known at the transmitter or receiver. For example, if there is one noisy version of SS known at the transmitter only, the capacity is 0.5log(1+PQ(N1/(Q+N1))+N0)0.5\log(1+\frac{P}{Q(N_1/(Q+N_1))+N_0}), where PP is the input power constraint and N1N_1 is the power of the noise corrupting SS. Further, it is shown that the capacity with knowledge of any independent noisy versions of SS at the transmitter is equal to the capacity with knowledge of the statistically equivalent noisy versions of SS at the receiver.

Keywords

Cite

@article{arxiv.0806.2643,
  title  = {On the Capacity Equivalence with Side Information at Transmitter and Receiver},
  author = {Yong Peng and Dinesh Rajan},
  journal= {arXiv preprint arXiv:0806.2643},
  year   = {2008}
}

Comments

5 pages in IEEE 2 column format, submitted to IEEE Trans. Information Theory in June, 2008