Channel simulation by interval algorithm: A performance analysis of interval algorithm
Channel simulation by interval algorithm: A performance analysis of interval algorithm
复制标题
通过间隔算法进行信道模拟：间隔算法的性能分析
DOI：
10.1109/18.782154
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
F. Kanaya
中科院分区：
文献类型：
--
作者：
T. Uyematsu;F. Kanaya
本文讨论了离散无记忆信道的模拟问题，提出了两种利用区间算法进行信道模拟的算法。第一种算法提供了精确的信道模拟，并且每个输入样本的公平随机比特数以概率1接近信道的条件可解性。第二种算法提供了近似的信道模拟和测量的近似误差的变化的距离呈指数消失的块长度趋于无穷大，当每个输入样本的公平随机比特的数量是上述的条件可解性。此外，这些算法以及原来的随机数生成的区间算法的一些渐近性质得到澄清。
This article deals with the problem of simulating a discrete memoryless channel and proposes two algorithms for channel simulation by using the interval algorithm. The first algorithm provides exact channel simulation and the number of fair random bits per input sample approaches the conditional resolvability of the channel with probability one. The second algorithm provides approximate channel simulation and the approximation error measured by the variational distance vanishes exponentially as the block length tends to infinity, when the number of fair random bits per input sample is above the conditional resolvability. Further, some asymptotic properties of these algorithms as well as the original interval algorithm for random number generation are clarified.