Duality between channel capacity and rate distortion with two-sided state information

被引:122
作者
Cover, TM [1 ]
Chiang, M [1 ]
机构
[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
channel with state information; duality; multiuser; information theory; rate distortion with state information; Shannon theory; writing on dirty paper;
D O I
10.1109/TIT.2002.1003843
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We show that the duality between channel capacity and data compression is retained when state information is available to the sender, to the receiver, to both, or to neither. We present a unified theory for eight special cases of channel capacity and rate distortion with state information, which also extends existing results to arbitrary pairs of independent and identically distributed (i.i.d.) correlated state information (S-1, S-2) available at the sender and at the receiver, respectively. In particular, the resulting general formula for channel capacity C = max(p(u, x\s1)) [I(U; S-2, Y) - I(U; S-1)] assumes the same form as the generalized Wyner-Ziv rate distortion function R(D) = min(p(u\x, s1)p((x) over cap \u, s2))[I(U; S-1, X) - I(U; S-2)].
引用
收藏
页码:1629 / 1638
页数:10
相关论文
共 21 条
[1]  
[Anonymous], 1971, RATE DISTORTION THEO
[2]  
Barron R. J., 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), DOI 10.1109/ISIT.2001.936163
[3]   On the capacity of some channels with channel state information [J].
Caire, G ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2007-2019
[4]  
CHIANG M, 2000, P INT S INF THEOR IT
[5]  
CHIANG M, 1999, THESIS STANFORD U ST
[6]  
CHOU J, 1999, P 33 AS C SIGN SYST
[7]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[8]  
EREZ U, 2000, P INT S INF THEOR IT
[9]  
Gel'fand S. I., 1980, Problems of Control and Information Theory, V9, P19
[10]   Optimal entropy-constrained scalar quantization of a uniform source [J].
György, A ;
Linder, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (07) :2704-2711