arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.3629cs.ITmath.IT
收藏

具有输入约束的信道中的信息耗散

Dissipation of information in channels with input constraints

Yury Polyanskiy, Yihong Wu

摘要:

作为信息论的基本原则之一,数据处理不等式指出,对于任何通道,输出发散不超过输入发散。对于没有输入限制的通道,对这种收缩量的各种估计是已知的,Dobrushin的总变化系数可能是最知名的。本文研究了具有平均投入成本约束的渠道。据发现,虽然收缩系数通常等于1(无收缩),但信息仍然会消散。提出了一种特定的非线性函数,即通道的\emph{Dobrushin curve},以量化耗散量。基于耦合参数,开发了用于评估加性噪声通道的多布鲁申曲线的工具。讨论了随机控制中的一些基本应用,吉布斯测度的唯一性和噪声电路的基本极限。作为应用,证明了在功率受限的$n$中继和高斯信道链中,端到端互信息和最大平方相关衰减为$Θ(\frac{\log\log n}{\log n})$,这与离散信道链中的指数衰减形成鲜明对比.类似地,噪声电路(由具有有界扇入的门组成)和树上的信息广播(有界度)的行为在信噪比(SNR)中不经历阈值行为。也就是说,与离散信道的情况不同,无论SNR如何,比特错误的概率保持远离$1\over 2$的边界。

英文摘要:

One of the basic tenets in information theory, the data processing inequality states that output divergence does not exceed the input divergence for any channel. For channels without input constraints, various estimates on the amount of such contraction are known, Dobrushin's coefficient for the total variation being perhaps the most well-known. This work investigates channels with average input cost constraint. It is found that while the contraction coefficient typically equals one (no contraction), the information nevertheless dissipates. A certain non-linear function, the \emph{Dobrushin curve} of the channel, is proposed to quantify the amount of dissipation. Tools for evaluating the Dobrushin curve of additive-noise channels are developed based on coupling arguments. Some basic applications in stochastic control, uniqueness of Gibbs measures and fundamental limits of noisy circuits are discussed. As an application, it shown that in the chain of $n$ power-constrained relays and Gaussian channels the end-to-end mutual information and maximal squared correlation decay as $Θ(\frac{\log\log n}{\log n})$, which is in stark contrast with the exponential decay in chains of discrete channels. Similarly, the behavior of noisy circuits (composed of gates with bounded fan-in) and broadcasting of information on trees (of bounded degree) does not experience threshold behavior in the signal-to-noise ratio (SNR). Namely, unlike the case of discrete channels, the probability of bit error stays bounded away from $1\over 2$ regardless of the SNR.

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

↑