DocumentCode :
2984718
Title :
On the rate-limited Gelfand-Pinsker problem
Author :
Tandon, Ravi ; Ulukus, Sennur
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
1963
Lastpage :
1967
Abstract :
We study a rate-limited version of the well known problem of coding for channels with random parameters which was studied by Gelfand and Pinsker [1]. In particular, we consider a state-dependent channel when the transmitter is supplied with the state information at a rate Re. We obtain a new upper bound on the capacity, C(Re), for this channel. We explicitly evaluate this upper bound for the rate-limited dirty paper coding (DPC) problem and show that it strictly improves upon the DPC capacity for certain values of Re.
Keywords :
channel coding; Gelfand-Pinsker problem; channel coding; rate-limited dirty paper coding; state-dependent channel; transmitter; Additive noise; Channel capacity; Channel state information; Decoding; Educational institutions; Gaussian noise; Memoryless systems; Transmitters; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205681
Filename :
5205681
Link To Document :
بازگشت