论文标题
一个动态计划，以实现多种访问渠道的能力，并没有噪音反馈
A dynamic program to achieve capacity of multiple access channel with noiseless feedback
论文作者
论文摘要
在本文中，我们考虑了评估具有无声反馈的多个访问通道（MAC）能力表达的问题。到目前为止，该通道的容量表达是通过Kramer [1]指示的多字母信息知道的。最近，在[2]中表明，可以将其置于动态优化问题中，但是，没有提供动态程序，因为作者声称没有两个发件人都观察到的状态概念。在本文中，我们基于[2]，以表明确实存在一个状态，因此是一个动态程序（DP），该状态分解了这个动态优化问题，并且等效地等效地评估了该通道能力的贝尔曼定点方程。我们这样做是通过定义对两个发件人的私人信息和私人信念的共同信念，并将这种共同信念作为系统的状态。我们进一步表明，该DP可以进一步降低到具有状态的DP，作为信息的共同信念。这提供了该渠道能力的单个字母表征。
In this paper, we consider the problem of evaluating capacity expression of a multiple access channel (MAC) with noiseless feedback. So far, the capacity expression for this channel is known through a multi letter directed information by Kramer [1]. Recently, it was shown in [2] that one can pose it as a dynamic optimization problem, however, no dynamic program was provided as the authors claimed there is no notion of state that is observed by both the senders. In this paper, we build upon [2] to show that there indeed exists a state and therefore a dynamic program (DP) that decomposes this dynamic optimization problem, and equivalently a Bellman fixed-point equation to evaluate capacity of this channel. We do so by defining a common belief on private messages and private beliefs of the two senders, and using this common belief as state of the system. We further show that this DP can be further reduced to a DP with state as the common belief on just the messages. This provides a single letter characterization of the capacity of this channel.
