本文提出了一种新的信息容量距离的概念，并给出了输入概率下平均交替信息容量的增量公式。设计了线性乘积交替和线性系数交替算法来计算任意离散无记忆信道的容量。这些算法优于现有的指数交替算法，并被证明在单步交替算法中几乎最佳。
摘要：
Introducing an notion of information-capacity-distance, this paper gives a increment for- mula of average alternate information capacity on input probability and designs a linearity- multiplied-alternate and a linearity-coefficient-alternate algorithm for computing the capac- ity of arbitrary discrete memoryless channels. These algorithms do better than exponent- alternate-algorithm in existence, and they are proved almost the best algorithm in all single step alternate algorithms.
展开
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
