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

多址信道信道容量的一种公式

A Formulation of the Channel Capacity of Multiple-Access Channel

Yoichiro Watanabe, Koichi Kamoi

摘要:

对N用户离散无记忆多址接入信道(MAC),给出了信道容量的充分必要条件。该公式的本质是调用{ \em elementary} MAC,其中输入字母表的大小不大于输出字母表的大小。主要目的是证明MAC的信道容量是由包含在原始MAC中的基本MAC实现的。通过初等MAC的定义,证明是非常简单的。证明了基本MAC的Kuhn-Tucker条件对于信道容量是严格充分和明显必要的。后一种证明需要一些步骤,使得对于基本MAC,Kuhn-Tucker条件的每个解在所有可能的输入概率分布的域上显示其自身为局部最大值,然后其实现信道容量。结果,就信道容量而言,MAC通常可以被认为是有限数量的基本MAC的集合。

英文摘要:

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of input alphabets are not greater than the size of output alphabet. The main objective is to demonstrate that the channel capacity of an MAC is achieved by an elementary MAC included in the original MAC. The proof is quite straightforward by the very definition of the elementary MAC. Moreover it is proved that the Kuhn-Tucker conditions of the elementary MAC are strictly sufficient and obviously necessary for the channel capacity. The latter proof requires some steps such that for the elementary MAC every solution of the Kuhn-Tucker conditions reveals itself as local maximum on the domain of all possible input probability distributions and then it achieves the channel capacity. As a result, in respect of the channel capacity, the MAC in general can be regarded as an aggregate of a finite number of elementary MAC's.

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

↑