arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.01394cs.ITmath.IT
收藏

满足信道容量的输出分布搜索算法

On the Search Algorithm for the Output Distribution that Achieves the Channel Capacity

Kenji Nakagawa, Kohei Watabe, Takuto Sabu

摘要:

我们考虑一个搜索算法的输出分布,实现了离散无记忆信道的信道容量。我们将提出一个算法,通过迭代投影的输出分布到仿射子空间的输出分布的集合。信道容量问题具有与欧氏空间中有限个点的最小包围圆问题相似的几何结构。欧氏空间中的度量是欧氏距离,输出分布空间中的度量是Kullback-Leibler散度。我们考虑这两个问题的基础上Amari的$α$-几何。然后,我们首先考虑欧氏空间中的最小封闭圆,并开发了一个算法来寻找最小封闭圆的中心。在此基础上,我们将把所得到的算法应用于信道容量的问题。

英文摘要:

We consider a search algorithm for the output distribution that achieves the channel capacity of a discrete memoryless channel. We will propose an algorithm by iterated projections of an output distribution onto affine subspaces in the set of output distributions. The problem of channel capacity has a similar geometric structure as that of smallest enclosing circle for a finite number of points in the Euclidean space. The metric in the Euclidean space is the Euclidean distance and the metric in the space of output distributions is the Kullback-Leibler divergence. We consider these two problems based on Amari's $α$-geometry. Then, we first consider the smallest enclosing circle in the Euclidean space and develop an algorithm to find the center of the smallest enclosing circle. Based on the investigation, we will apply the obtained algorithm to the problem of channel capacity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑