Bounds on the Achievable Rates of Faded Dirty Paper Channel

 Zouhair Al-qudah1 , Wael Abu Shehab2 

1Department of Communication Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan 2Department of Electrical Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan

 ABSTRACT 

Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the interference signal but not its fading coefficients are given. We generalize the analysis which were studied in many other references such that their results are special cases of our analysis. We enforce our bounds by simulations in which many numerical examples are drawn and investigated under different cases. 

KEYWORDS 

Dirty paper coding, lattice encoding and decoding, fading channel, Viterbi Algorithm. 

More Details....