论文信息 - An algorithm for computing the capacity of arbitrary discrete memoryless channels

An algorithm for computing the capacity of arbitrary discrete memoryless channels

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.

Suguru Arimoto | S. Arimoto

[1] S. Muroga. On the Capacity of a Discrete Channel. I Mathematical expression of capacity of a channel which is disturbed by noise in its every one symbol and expressible in one state diagram , 1953 .

[2] Solomon Kullback,et al. Information Theory and Statistics , 1960 .

[3] Hermann J. Helgert,et al. On a bound for channel capacity (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[4] Bernd Meister,et al. On the Capacity of a Discrete, Constant Channel , 1967, Inf. Control..

[5] Hermann J. Helgert. A comparison of arbitrary and symmetric channels on the basis of capacity , 1967, IEEE Trans. Inf. Theory.