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

探测能力

Probing Capacity

Himanshu Asnani, Haim Permuter, Tsachy Weissman

摘要:

我们考虑的问题,最佳的探测状态的信道的发送器和接收器的最大化率的可靠通信。该信道是具有i.i.d.的离散无记忆(DMC)信道。states.编码器根据消息采取探测操作。然后,它使用从因果或非因果探测获得的状态信息来生成信道输入符号。解码器还可以根据观察到的信道输出采取信道探测动作,并且使用由此获取的信道状态信息以及信道输出来估计消息。我们将这种系统的可靠通信的最大可实现速率称为“探测能力”。当编码器和解码器的动作是成本约束时,我们表征这种能力。为了激发这个问题,我们首先描述的容量和分数之间的权衡信道状态的编码器被允许观察,而解码器是知道的信道状态。在编码器处的“观察或不观察”状态的这种设置中,我们计算某些数值示例并注意到令人愉快的现象,其中编码器可以观察相对小部分的状态,但仍以最大速率进行通信,即在编码器处观察状态时的速率不受成本约束。

英文摘要:

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions dependent on the message. It then uses the state information obtained from probing causally or non-causally to generate channel input symbols. The decoder may also take channel probing actions as a function of the observed channel output and use the channel state information thus acquired, along with the channel output, to estimate the message. We refer to the maximum achievable rate for reliable communication for such systems as the 'Probing Capacity'. We characterize this capacity when the encoder and decoder actions are cost constrained. To motivate the problem, we begin by characterizing the trade-off between the capacity and fraction of channel states the encoder is allowed to observe, while the decoder is aware of channel states. In this setting of 'to observe or not to observe' state at the encoder, we compute certain numerical examples and note a pleasing phenomenon, where encoder can observe a relatively small fraction of states and yet communicate at maximum rate, i.e. rate when observing states at encoder is not cost constrained.

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

↑