Writing on dirty paper (Corresp.)
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (3) , 439-441
- https://doi.org/10.1109/tit.1983.1056659
Abstract
A channel with outputY = X + S + Zis examined, The stateS \sim N(0, QI)and the noiseZ \sim N(0, NI)are multivariate Gaussian random variables (Iis the identity matrix.). The inputX \in R^{n}satisfies the power constraint(l/n) \sum_{i=1}^{n}X_{i}^{2} \leq P. IfSis unknown to both transmitter and receiver then the capacity is\frac{1}{2} \ln (1 + P/( N + Q))nats per channel use. However, if the stateSis known to the encoder, the capacity is shown to beC^{\ast} =\frac{1}{2} \ln (1 + P/N), independent ofQ. This is also the capacity of a standard Gaussian channel with signal-to-noise power ratioP/N. Therefore, the stateSdoes not affect the capacity of the channel, even thoughSis unknown to the receiver. It is shown that the optimal transmitter adapts its signal to the stateSrather than attempting to cancel it.Keywords
This publication has 3 references indexed in Scilit:
- Achievable rates for multiple descriptionsIEEE Transactions on Information Theory, 1982
- A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)IEEE Transactions on Information Theory, 1981
- Multiple user information theoryProceedings of the IEEE, 1980