Capacity of a class of deterministic relay channels

被引：73
作者：
Kim, Young-Han [1 ]
机构：
[1] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 03期
基金：
美国国家科学基金会;
关键词：
capacity; deterministic relay channel; primitive relay channel;
D O I：
10.1109/TIT.2007.915921
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The capacity of a class of deterministic relay channels with transmitter input X, receiver output Y, relay output Y-1 = f(X, Y), and separate noiseless communication link of capacity R-0 from the relay to the receiver, is shown to be C(R-0) = sup(p(x)) min{I(X ; Y) + R-0, I(X ; Y, Y-1)}. Roughly speaking, every bit from the relay is worth one bit to the receiver until saturation at capacity.
引用
收藏
页码：1328 / 1329
页数：2
相关论文
共 14 条
[1]   ON SOURCE-CODING WITH SIDE INFORMATION VIA A MULTIPLE-ACCESS CHANNEL AND RELATED PROBLEMS IN MULTI-USER INFORMATION-THEORY [J].
AHLSWEDE, R ;
HAN, TS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :396-412
[2]  
ALEKSIC M, 2007, UNPUB IEEE T INF JUN
[3]  
[Anonymous], 2006, Elements of information theory
[4]  
Cover T. M., 1987, OPEN PROBLEMS COMMUN, P72
[5]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[6]  
COVER TM, 2007, P IEEE INT S INF THE, P591
[7]   Relay networks with delays [J].
El Gamal, Abbas ;
Hassanpour, Navid ;
Mammen, James .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) :3413-3431
[8]  
ELGAMAL A, 1982, IEEE T INFORM THEORY, V28, P536, DOI 10.1109/TIT.1982.1056502
[9]  
KIM YH, 2007, P 45 ANN ALL C COMM
[10]   Cooperative strategies and capacity theorems for relay networks [J].
Kramer, G ;
Gastpar, M ;
Gupta, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063
12