Capacity of a Class of Deterministic Relay Channels

Details Capacity of a Class of Deterministic Relay Channels Capacity of a Class of Deterministic Relay Channels

2006-11-13

arxiv.org/abs/cs/0611053v1

Computer Science

Information Theory

17 pages, submitted to IEEE Transactions on Information Theory

Scientific paper

The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate communication link from the relay to the receiver with capacity R_0, is shown to be C(R_0) = \max_{p(x)} \min \{I(X;Y)+R_0, I(X;Y, Y_1) \}. Thus every bit from the relay is worth exactly one bit to the receiver. Two alternative coding schemes are presented that achieve this capacity. The first scheme, ``hash-and-forward'', is based on a simple yet novel use of random binning on the space of relay outputs, while the second scheme uses the usual ``compress-and-forward''. In fact, these two schemes can be combined together to give a class of optimal coding schemes. As a corollary, this relay capacity result confirms a conjecture by Ahlswede and Han on the capacity of a channel with rate-limited state information at the decoder in the special case when the channel state is recoverable from the channel input and the output.

Affiliated with

Also associated with

No associations

Rating

Capacity of a Class of Deterministic Relay Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Capacity of a Class of Deterministic Relay Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of a Class of Deterministic Relay Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487855