Computation of total capacity for discrete memoryless multiple-access channels

Authors:
M. Rezaeian;A. Grant
Affiliations:
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

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

Quantified Score

Hi-index	754.90

Visualization

Abstract

The Arimoto-Blahut (1972) algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MAC). In addition, a class of MAC is defined with the property that the uniform distribution achieves the total capacity. These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known symmetry property for single-user channels.