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

一般信源和信道的信道可分解性定理

Channel Resolvability Theorems for General Sources and Channels

Hideki Yagi

摘要:

在信道可分辨性问题中,通过变换均匀随机数来近似信道上给定的输出概率分布,刻画随机数大小的渐近最小比率,称为信道可分辨性,一直是公开的。本文推导了一般信源信道对的信道可分辨性公式。我们还研究了信道可分辨性在一个乐观的意义。结果表明,推导出的一般公式重现了平稳无记忆源和信道的单字母公式。当信道为恒等映射时,所建立的公式可归结为谱超熵率的另一种形式,而谱超熵率在信息谱方法中起着关键作用。分析还扩展到二阶通道的可分辨性。

英文摘要:

In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by transforming the uniform random numbers, characterizing the asymptotically minimum rate of the size of the random numbers, called the channel resolvability, has been open. This paper derives formulas for the channel resolvability for a given general source and channel pair. We also investigate the channel resolvability in an optimistic sense. It is demonstrated that the derived general formulas recapture a single-letter formula for the stationary memoryless source and channel. When the channel is the identity mapping, the established formulas reduce to an alternative form of the spectral sup-entropy rates, which play a key role in information spectrum methods. The analysis is also extended to the second-order channel resolvability.

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

↑