DocumentCode :
1078872
Title :
Capacity of a Class of Deterministic Relay Channels
Author :
Kim, Young-Han
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., La Jolla, CA
Volume :
54
Issue :
3
fYear :
2008
fDate :
3/1/2008 12:00:00 AM
Firstpage :
1328
Lastpage :
1329
Abstract :
The capacity of a class of deterministic relay channels with transmitter input X, receiver output Y, relay output Y1 = f(X, Y), and separate noiseless communication link of capacity R0 from the relay to the receiver, is shown to be C(R0) = sup min {I(X;Y) + R0, I(X;Y,Y,)}. P(x) Roughly speaking, every bit from the relay is worth one bit to the receiver until saturation at capacity.
Keywords :
channel capacity; channel capacity; deterministic relay channels; noiseless communication; Broadcasting; Communication system control; Decoding; Digital relays; Information theory; Transmitters; Upper bound; Capacity; deterministic relay channel; primitive relay channel;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2007.915921
Filename :
4455746
Link To Document :
بازگشت