Capacity of a Class of Deterministic Relay Channels
Young-Han Kim
Dept. of Electr. & Comput. Eng., California Univ., La Jolla, CA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: March 2008
Volume: 54,
Issue: 3
On page(s): 1328-1329
ISSN: 0018-9448
INSPEC Accession Number: 10145827
Digital Object Identifier: 10.1109/TIT.2007.915921
Current Version Published: 2008-02-22
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
