1On the Robustness of Dirty Paper Coding

AbstractA dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge. We focus on a communication scenario where the signal-to-noise ratio is high. Our approach is based on analyzing the performance achievable using lattice-based coding schemes. When the power of the interference is nite, we show that the achievable rate of this lattice-based coding scheme may be improved by a judicious choice of the scaling parameter at the receiver. We further show that the communication rate may be improved, for nite as well as innite interference power, by allowing randomized scaling at the transmitter. Index TermsDirty paper coding, Tomlinson-Harashima pre-coding, channel estimation error, compound channel, channel state information. I