Title :
A generalization of Arimoto-Blahut algorithm
Author :
Rezaeian, Mohammad ; Grant, Alex
Author_Institution :
Inst. for Telecommun. Res., South Australia Univ., Mawson Lakes, SA, Australia
fDate :
27 June-2 July 2004
Abstract :
The Arimoto-Blahut algorithm is generalized for computation of the total capacity of discrete memoryless multiple access channels. This extension is based on the specialization of the Kuhn-Tucker condition for the total capacity of the multiple access channel, and depends on the result announced by Y. Watanabe et al. (2002) concerning the sufficiency of the Kuhn-Tucker condition.
Keywords :
algorithm theory; channel capacity; memoryless systems; multi-access systems; optimisation; Arimoto-Blahut algorithm; Kuhn-Tucker condition; channel capacity; discrete memoryless multiple access channel; Australia; Capacity planning; Channel capacity; Lakes; Mutual information; Particle measurements; Probability distribution; Random variables; Telecommunication computing;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365217
