On duality relations for the discrete memoryless multiple access and broadcast channel

Duality between multiple-access (MAC) and broadcast channels (BC) is an interesting and useful concept in multi-user information theory. While duality relationships have been established for some Gaussian and deterministic channels, the question to what extent and under which conditions duality holds for the case of discrete memoryless channels still remains open. In this paper, we define the notion of weak duality, closely related to the existing duality definitions. We give a sufficient condition and a necessary condition for a BC to be weakly dual to a discrete MAC of a certain type. Exemplarily, we use these conditions to derive a weak duality relation between the binary symmetric BC and this class of discrete MACs.

[1]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[2]  Daniel Pérez Palomar,et al.  The Computation of the Capacity Region of the Discrete MAC is a Rank-One Non-Convex Optimization Problem , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Nihar Jindal,et al.  On the duality between general multiple-access/broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[5]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[6]  Andrea J. Goldsmith,et al.  On the duality of Gaussian multiple-access and broadcast channels , 2002, IEEE Transactions on Information Theory.

[7]  Wei Yu,et al.  Uplink-downlink duality via minimax duality , 2006, IEEE Transactions on Information Theory.

[8]  Gerhard Wunder,et al.  On Capacity Computation for the Two-User Binary Multiple-Access Channel , 2009, ArXiv.

[9]  Henry Herng-Jiunn Liao,et al.  Multiple access channels (Ph.D. Thesis abstr.) , 1973, IEEE Trans. Inf. Theory.