A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results

Channel symmetry properties that imply the tightness of Shannon's random coding inner bound have recently been used to determine the capacity region of discrete-memoryless two-way channels (DM-TWCs). For channels without such symmetry properties, outer bounds are often needed to estimate the capacity region. However, validating symmetry conditions and/or evaluating non-trivial outer bounds are computationally demanding, especially for channels with large input and output alphabets. In this paper, three easy-to-check conditions that identify DM-TWCs with no such symmetry properties as well as an easy-to-compute outer bound are derived. The bound is obtained from Shannon's inner bound computation but is non-trivial. Using this outer bound, approximate capacity results can be established for certain DM-TWCs. The results are illustrated by two examples.

[1]  Te Sun Han,et al.  A general coding scheme for the two-way channel , 1984, IEEE Trans. Inf. Theory.

[2]  Lav R. Varshney.  Two way communication over exponential family type channels , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Natasha Devroye,et al.  Error Exponents of Parallel Two-way Discrete Memoryless Channels using Variable Length Coding , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[4]  Lawrence Ong,et al.  Capacity results for two classes of three-way channels , 2012, 2012 International Symposium on Communications and Information Technologies (ISCIT).

[5]  Aydin Sezgin,et al.  Three-Way Channels With Multiple Unicast Sessions: Capacity Approximation via Network Transformation , 2016, IEEE Transactions on Information Theory.

[6]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[7]  Natasha Devroye,et al.  Two-Way Networks: When Adaptation is Useless , 2012, IEEE Transactions on Information Theory.

[8]  Fady Alajaji,et al.  Capacity of Two-Way Channels With Symmetry Properties , 2019, IEEE Transactions on Information Theory.

[9]  Meir Feder,et al.  The uniform distribution as a universal prior , 2004, IEEE Transactions on Information Theory.

[10]  Mohamed-Slim Alouini,et al.  The capacity of injective semi-deterministic two-way channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Haim H. Permuter,et al.  An Achievable Rate Region for the Two-Way Channel with Common Output , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Mohamed-Slim Alouini,et al.  Classes of Full-Duplex Channels With Capacity Achieved Without Adaptation , 2020, IEEE Transactions on Communications.

[13]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[14]  Hb Erik Meeuwissen.  Information theoretical aspects of two-way communication , 1998 .

[15]  Toby Berger,et al.  New outer bounds to capacity regions of two-way channels , 1986, IEEE Trans. Inf. Theory.

[16]  Fady Alajaji,et al.  Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[17]  Ofer Shayevitz,et al.  On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[18]  Fady Alajaji,et al.  Capacity of Generalized Discrete-Memoryless Push-to-Talk Two-Way Channels , 2019, 2019 16th Canadian Workshop on Information Theory (CWIT).