記憶のない通信路の容量の計算法

概要

論文の詳細を見る
The capacity of discrete,memoryless channels is evaluated only in certain special circumstances by a straightforward calculation or Muroga's method which directly maximizes the transinformation employing inversion of channel matrices. Unfortunately, Muroga's method cannot be adopted to the case when dealing nonsquare channel matrices and even square channel matrices for which the method leads to negative probabilities of input signal distribution. This paper presents a systematic method of computing capacity of arbitrary, discrete, memoryless channels. The algorithm of this method which approximates the capacity iteratively is very simple and involves only calculations of logarithm and exponential besides elementary arithmetical operations. It has also the property of monotone convergence for the capacity,and it is shown that,in general,the order of convergence of the error is at least inversely proportionate to the number of iterations and,in a certain case,it is exponential. Finally,a few inequalities which give an upper or lower bound to the capacity are derived.
一般社団法人情報処理学会の論文
1970-02-15