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

对称信道近似仿真的精细渐近分析

Fine asymptotics for approximate simulation of symmetric channels

University of Cambridge(剑桥大学);Cornell University(康奈尔大学)

Valentinian Lungu, Aaron B. Wagner, Ioannis Kontoyiannis

AI总结:

该研究针对正态近似机制下的对称信道近似仿真问题,利用ε-光滑信道最大信息改进离散无记忆信道的最小码本大小近似,得到Gallager对称信道的三阶展开式,发现奇异与非奇异信道的三阶项差距方向与信道编码相反。

摘要:

我们研究正态近似机制下的近似信道仿真问题。我们的出发点是Cao等人[Cao_channel_simulation]提出的结论:固定误差容限ε>0时,最小码本大小M_ε^*(W)与ε-光滑信道最大信息I_max^ε(W)密切相关。利用这一点,我们对离散无记忆信道的M_ε^*(W^{⊗n))的早期长块长度近似进行了改进。具体而言,我们为Gallager对称信道提供了紧密的三阶展开式,并证明三阶项与信道相关。与相应的信道编码展开式一样,我们识别出奇异信道与非奇异信道之间存在显著的速率差距。值得注意的是,该差距的方向与信道编码的情况相反:奇异信道的三阶项为-1/2 log n,而非奇异信道的三阶项为O(log log n)。

英文摘要:

We study the approximate channel simulation problem in the normal approximation regime. Our starting point is the fact established by Cao et al.~\cite{Cao_channel_simulation}, that the minimal codebook size $M_ε^*(W)$ for a fixed error tolerance $ε>0$ is closely related to the $ε$-smooth channel max-information, $I_{\max}^ε(W)$. Using this, we refine earlier large-blocklength approximations to $M_ε^*(W^{\otimes n})$ for discrete memoryless channels. Specifically, we provide tight third-order expansions for Gallager-symmetric channels and demonstrate that the third-order term is channel-dependent. As in corresponding channel coding expansions, we identify a substantial rate gap between singular and nonsingular channels. Notably, the direction of this gap is reversed relative to channel coding: The third-order term is $-\frac{1}{2}\log n$ for singular channels but $O(\log\log n)$ for nonsingular channels.

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

↑