On the robustness of dirty paper coding

  • Authors:
  • Anatoly Khina;Uri Erez

  • Affiliations:
  • Department of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel;Department of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.