New Upper Bounds on the Capacity of Primitive Diamond Relay Channels

Consider a primitive diamond relay channel, where a source X wants to send information to a destination with the help of two relays Y1 and Y2, and the two relays can communicate to the destination via error-free digital links of capacities C1 and C2 respectively, while Y1 and Y2 are conditionally independent given X. In this paper, we develop new upper bounds on the capacity of such primitive diamond relay channels that are tighter than the cut-set bound. Our results include both the Gaussian and the discrete memoryless case and build on the information inequalities recently developed in [6]–[8] that characterize the tension between information measures in a certain Markov chain.

[1]  Brett Schein,et al.  Distributed coordination in network information theory , 2001 .

[2]  Ayfer Özgür,et al.  Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets , 2016, IEEE Transactions on Information Theory.

[3]  Ayfer Özgür,et al.  Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity , 2018, IEEE Transactions on Information Theory.

[4]  Gerhard Kramer,et al.  Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel , 2015, IEEE Transactions on Information Theory.

[5]  Nan Liu,et al.  The Gaussian multiple access diamond channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[7]  Ayfer Özgür,et al.  Cut-set bound is loose for Gaussian relay networks , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[9]  Shlomo Shamai,et al.  Fronthaul Compression for Cloud Radio Access Networks: Signal processing advances inspired by network information theory , 2014, IEEE Signal Processing Magazine.

[10]  Ayfer Özgür,et al.  The geometry of the relay channel , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Ayfer Özgür,et al.  “The Capacity of the Relay Channel”: Solution to Cover’s Problem in the Gaussian Case , 2017, IEEE Transactions on Information Theory.

[12]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[13]  Feng Xue,et al.  A New Upper Bound on the Capacity of a Primitive Relay Channel Based on Channel Simulation , 2014, IEEE Transactions on Information Theory.

[14]  Shlomo Shamai,et al.  On the capacity of cloud radio access networks with oblivious relaying , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).