ALGORITHM FOR COMPUTING CAPACITY OF ARBITRARY DISCRETE MEMORYLESS CHANNELS
ALGORITHM FOR COMPUTING CAPACITY OF ARBITRARY DISCRETE MEMORYLESS CHANNELS
复制标题
DOI：
10.1109/tit.1972.1054753
复制
发表时间：
1972-01-01
影响因子：
2.5
通讯作者：
ARIMOTO, S
中科院分区：
文献类型：
--
作者：
ARIMOTO, S
提出了一种计算任意离散无记忆信道容量的系统迭代方法。该算法非常简单，除了基本的算术运算外，只涉及对数和指数。它对容量也具有单调收敛的性质。一般来说，近似误差至少与迭代次数成反比；在某些情况下，它呈指数递减。最后，给出了给出容量上界和下界的几个不等式。
A systematic and iterative method of computing the capacity of arbitrary discrete memoryless channels is presented. The algorithm is very simple and involves only logarithms and exponentials in addition to elementary arithmetical operations. It has also the property of monotonic convergence to the capacity. In general, the approximation error is at least inversely proportional to the number of iterations; in certain circumstances, it is exponentially decreasing. Finally, a few inequalities that give upper and lower bounds on the capacity are derived.