On the robustness of dirty paper coding

Research output: Contribution to journalArticlepeer-review


A 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 finite, 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 finite as well as infinite interference power, by allowing randomized scaling at the transmitter.

Original languageEnglish
Article number5464243
Pages (from-to)1437-1446
Number of pages10
JournalIEEE Transactions on Communications
Issue number5
StatePublished - May 2010


  • Channel estimation error
  • Channel state information
  • Compound channel
  • Dirty paper coding
  • Harashima precoding
  • Tomlinson


Dive into the research topics of 'On the robustness of dirty paper coding'. Together they form a unique fingerprint.

Cite this