On Capacity Computation for the Two-User Binary Multiple-Access Channel

This paper deals with the computation of the boundary of the capacity region for the two-user memoryless multiple-access channel, which is equivalent to solving a difficult non-convex optimization problem. We study properties of the optimality conditions for a relaxation (cooperation) approach suggested in the literature. We give conditions under which a solution to the relaxed problem has the same value as the actual optimal solution and show that these conditions can in some cases be applied to construct solutions for a restricted class of discrete multiple-access channel using convex optimization.

[1]  Yoichiro Watanabe.  The total capacity of two-user multiple-access channel with binary output , 1996, IEEE Trans. Inf. Theory.

[2]  K. Kamoi,et al.  The total capacity of multiple-access channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

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

[5]  Yoichiro Watanabe,et al.  A Formulation of the Channel Capacity of Multiple-Access Channel , 2009, IEEE Transactions on Information Theory.

[6]  Alex J. Grant,et al.  Computation of total capacity for discrete memoryless multiple-access channels , 2004, IEEE Transactions on Information Theory.

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

[8]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[9]  Gerhard Wunder,et al.  On duality relations for the discrete memoryless multiple access and broadcast channel , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[11]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

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

[13]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[14]  Gerhard Wunder,et al.  On capacity computation for the two-user binary multiple-access channel: Solutions by cooperation , 2010, 2010 IEEE Sarnoff Symposium.