Capacity of a Class of Deterministic Relay Channels

The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y1 = f(X,Y), and a separate communication link from the relay to the receiver with capacity R0, is shown to be C(R0) =max min{I(X;Y) + R0, I(X;Y,Y1)}. p(x) 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 variation of the usual random binning on the relay outputs, while the second scheme uses the usual "compress-and- forward". In fact, these two schemes can be combined 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 output.

[1]  E. Meulen THREE-TERMINAL COMMUNICATION CHANNELS , 1971 .

[2]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[3]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[4]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[5]  Giuseppe Longo,et al.  The information theory approach to communications , 1977 .

[6]  J. Wolfowitz The rate distortion function for source coding with side information at the decoder , 1979 .

[7]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[8]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[9]  Rudolf Ahlswede,et al.  On source coding with side information via a multiple-access channel and related problems in multi-user information theory , 1983, IEEE Trans. Inf. Theory.

[10]  T. Cover The Capacity of the Relay Channel , 1987 .

[11]  Zhen Zhang,et al.  Partial converse for a relay channel , 1988, IEEE Trans. Inf. Theory.

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[14]  Abbas El Gamal,et al.  Relay Networks With Delays , 2007, IEEE Transactions on Information Theory.

[15]  Wei Yu,et al.  Capacity of a Class of Modulo-Sum Relay Channels , 2007, IEEE Transactions on Information Theory.

[16]  Young-Han Kim Capacity of a Class of Deterministic Relay Channels , 2008, IEEE Trans. Inf. Theory.

[17]  Young-Han Kim,et al.  Coding Techniques for Primitive Relay Channels , 2008 .