Computation of total capacity for discrete memoryless multiple-access channels

被引:14
|
作者
Rezaeian, M [1 ]
Grant, A [1 ]
机构
[1] Univ S Australia, Inst Telecommun Res, Mawson Lakes, SA 5095, Australia
基金
澳大利亚研究理事会;
关键词
Arimoto-Blahut algorithm; capacity; multiple-access channel (MAC); nonconvex optimization;
D O I
10.1109/TIT.2004.836661
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Arimoto-Blahut algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MACs). In addition, a class of MACs 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.
引用
收藏
页码:2779 / 2784
页数:6
相关论文
共 50 条