Finite block-length achievable rates for queuing timing channels
Finite block-length achievable rates for queuing timing channels
复制标题
排队定时通道的有限块长度可达到的速率
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
A. Singer
中科院分区：
文献类型：
--
作者：
Thomas J. Riedl;T. Coleman;A. Singer
指数服务器定时信道是已知的最简单的，并且在某种意义上是规范的排队定时信道。这个无限内存通道的容量是已知的。在这里，我们讨论实际的有限长度的码字的限制，并试图了解的最大速率，可以达到一个目标的错误概率。通过使用马尔可夫链分析，我们证明了一个下界的最大信道编码率可达到的块长度为n和错误概率<inf>为n</inf>。该界近似为C-n<sup>−1/2</sup> σQ（<inf>n</inf>），其中Q表示Q函数，σ<sup>2</sup>是底层马尔可夫链的渐近方差。给出了σ<sup>2</sup>的封闭形式表达式。
The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a target error probability. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at blocklength n and error probability <inf>Є</inf>. The bound is approximated by C — n<sup>−1/2</sup> σQ (<inf>Є</inf>) where Q denotes the Q-function and σ<sup>2</sup> is the asymptotic variance of the underlying Markov chain. A closed form expression for σ<sup>2</sup> is given.