Capacity of a Class of Modulo-Sum Relay Channels

This paper characterizes the capacity of a class of modular additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a previous conjecture on the capacity of channels with rate-limited side information at the receiver for this particular class of modulo-sum channels. This paper also considers a more general setting in which the relay is capable of conveying noncausal rate-limited side information about the noise to both the transmitter and the receiver. The capacity is characterized for the case where the channel is binary symmetric with a crossover probability 1/2. In this case, the rates available for conveying side information to the transmitter and to the receiver can be traded with each other arbitrarily-the capacity is a function of the sum of the two rates.

[1]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

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

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

[4]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[5]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[6]  Shlomo Shamai,et al.  On channels with partial channel state information at the transmitter , 2005, IEEE Transactions on Information Theory.

[7]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[8]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

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

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

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

[12]  Young-Han Kim,et al.  Capacity of a Class of Deterministic Relay Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[13]  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.

[14]  Yingbin Liang,et al.  Gaussian orthogonal relay channels: optimal resource allocation and capacity , 2005, IEEE Transactions on Information Theory.

[15]  Kenneth Rose,et al.  Additive successive refinement , 2003, IEEE Trans. Inf. Theory.

[16]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.