A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications

We establish a new upper bound on the capacity of the relay channel which is tighter than all previous bounds. The upper bound uses traditional weak converse techniques involving mutual information inequalities and identification of auxiliary random variables via past and future channel random variable sequences. We show that the new bound is strictly tighter than all previous bounds for the Gaussian relay channel for every set of non-zero channel gains. When specialized to the class of relay channels with orthogonal receiver components, the bound resolves a conjecture by Kim on a class of deterministic relay channels. When further specialized to the class of product-form relay channels with orthogonal receiver components, the bound resolves a generalized version of Cover's relay channel problem, recovers the recent upper bound for the Gaussian case by Wu et al. and also improves upon the recent bounds for the binary symmetric case by Wu et al. and Barnes et al., which were all obtained using non-traditional geometric proof techniques.

[1]  Lucas N. H. Bunt Bijdrage tot de theorie der convexe puntverzamelingen , 1934 .

[2]  Rudolf Ahlswede,et al.  Appendix: On Common Information and Related Characteristics of Correlated Information Sources , 2006, GTIT-C.

[3]  Mehul Motani,et al.  Generalized Backward Decoding Strategies for the Relay Channel , 2007, IEEE Transactions on Information Theory.

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

[5]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

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

[7]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[8]  Abbas El Gamal,et al.  The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.

[9]  Abbas El Gamal,et al.  Bounds on capacity and minimum energy-per-bit for AWGN relay channels , 2006, IEEE Transactions on Information Theory.

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

[11]  Chandra Nair,et al.  The Capacity Region of the Two-Receiver Gaussian Vector Broadcast Channel With Private and Common Messages , 2014, IEEE Transactions on Information Theory.

[12]  S. Hewitt,et al.  2007 , 2018, Los 25 años de la OMC: Una retrospectiva fotográfica.

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

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

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

[16]  Sennur Ulukus,et al.  A new upper bound on the capacity of a class of primitive relay channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

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

[19]  Amin Gohari,et al.  Outer Bounds for Multiuser Settings: The Auxiliary Receiver Approach , 2022, IEEE Transactions on Information Theory.

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

[21]  Chandra Nair,et al.  Upper concave envelopes and auxiliary random variables , 2013 .

[22]  Jingbo Liu Minoration via Mixed Volumes and Cover's Problem for General Channels , 2020, ArXiv.

[23]  野崎 隆之,et al.  国際会議参加報告:IEEE International Symposium on Information Theory , 2015 .

[24]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[25]  Ayfer Özgür,et al.  A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphere , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[26]  Halim Yanikomeroglu,et al.  Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress? , 2013, IEEE Transactions on Communications.

[27]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

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

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

[30]  Ayfer Özgür,et al.  New Converses for the Relay Channel via Reverse Hypercontractivity , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[31]  Thomas M. Cover,et al.  Network Information Theory , 2001 .