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
On capacity computation for the two-user binary multiple-access channel: solutions by cooperation
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
On the computation of the capacity region of the discrete MAC
IEEE Transactions on Communications
| Hi-index | 754.90 |
The total capacity is evaluated for an arbitrary two-user multiple-access channel (MAC) with a binary output. The basic idea is to subdivide the MAC into a finite number of elementary MACs, i.e., a two-user MAC with binary inputs and binary outputs. These elementary MACs are classified further into two cases by the type of channel matrix. For each case, a necessary and sufficient condition of the total capacity is established by partially converting the ordinary Kuhn-Tucker condition. The solution of the necessary and sufficient condition determines the optimal distribution that achieves the total capacity of the elementary MAC. Then, for the arbitrary two-user MAC, it is shown that the total capacity is determined by evaluating the finite number of total capacities for those elementary MACs. An iteration procedure is proposed to calculate the total capacity of the MAC