Title :
Computation of total capacity for discrete memoryless multiple-access channels
Author :
Rezaeian, Mohammad ; Grant, Alex
Author_Institution :
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
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.
Keywords :
channel capacity; concave programming; memoryless systems; multi-access systems; statistical distributions; symmetry; Arimoto-Blahut algorithm; Kuhn-Tucker condition; MAC; discrete memoryless channels; multiple-access channels; nonconvex optimization; symmetry property; total capacity; uniform distribution; Australia; Channel capacity; Distributed computing; Entropy; Information theory; Lakes; Mutual information; Probability distribution; Random variables; Arimoto–Blahut algorithm; MAC; capacity; multiple-access channel; nonconvex optimization;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.836661
