Capacity Theorems for the “Z” Channel

We consider the two-user "Z" channel (ZC), where there are two senders and two receivers. One of the senders transmits information to its intended receiver (without interfering with the unintended receiver), while the other sender transmits information to both receivers. The complete characterization of the discrete memoryless ZC remains unknown to date. For the Gaussian ZC, the capacity has only been established for a crossover link gain of 1. In this work, we study both the discrete memoryless ZC and the Gaussian ZC. We first establish achievable rates for the general discrete memoryless ZC. The coding strategy uses rate-splitting and superposition coding at the sender with information for both receivers. At the receivers, we use joint decoding. We then specialize the rates obtained to two different types of degraded discrete memoryless ZCs and also derive respective outer bounds to their capacity regions. We show that as long as a certain condition is satisfied, the achievable rate region is the capacity region for one type of degraded discrete memoryless ZC. The results are then extended to the two-user Gaussian ZC with different crossover link gains. We determine an outer bound to the capacity region of the Gaussian ZC with strong crossover link gain and establish the capacity region for moderately strong crossover link gain

[1]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[2]  J. Pearl Causality: Models, Reasoning and Inference , 2000 .

[3]  Nan Liu,et al.  On the capacity region of the Gaussian Z-channel , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[4]  G. Kramer,et al.  Review of Rate Regions for Interference Channels , 2006, 2006 International Zurich Seminar on Communications.

[5]  Gerhard Kramer,et al.  Outer bounds on the capacity of Gaussian interference channels , 2004, IEEE Transactions on Information Theory.

[6]  Andrea J. Goldsmith,et al.  The "Z" channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

[8]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[9]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[10]  Max H. M. Costa,et al.  On the Gaussian interference channel , 1985, IEEE Trans. Inf. Theory.

[11]  Gerhard Kramer Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.