Convex Optimization
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A formulation of the channel capacity of multiple-access channel
IEEE Transactions on Information Theory
On capacity computation for the two-user binary multiple-access channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The total capacity of two-user multiple-access channel with binary output
IEEE Transactions on Information Theory
Computation of total capacity for discrete memoryless multiple-access channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.