On the Evaluation of the Polyanskiy-Poor–Verdú Converse Bound for Finite Block-Length Coding in AWGN
On the Evaluation of the Polyanskiy-Poor–Verdú Converse Bound for Finite Block-Length Coding in AWGN
复制标题
AWGN 中有限块长度编码的 Polyanskiy-Poor-Verdú 逆界评估
DOI：
--
复制
发表时间：
2014
影响因子：
2.5
通讯作者：
T. Erseghe
中科院分区：
文献类型：
--
作者：
T. Erseghe
最近，Polyanskiy-Poor-Verdu（PPV）提出了在有限块长度范围内和在加性白色高斯噪声条件下的信道编码速率的紧匡威。该界是其他一些经典结果的推广，并且它也被声称等价于香农1959年的锥填充界。在本文中，我们调查的方法，一个可靠的数值评估的界限，这是麻烦的，即使不是太大的值的块长度n，通过competently表示Polyanskiy，穷人，和Verdu '（PPV）匡威界的非中心卡方分布，并通过评估这些通过积分表达式和相应的级数展开，利用Temme提出的方法。其结果是，一个强大的评估方法和新的见解上界的渐近性，以及新的近似表达式，得到。
A tight converse bound to the channel coding rate in the finite block-length regime and under additive white Gaussian noise conditions was recently proposed by Polyanskiy-Poor-Verdú (PPV). The bound is a generalization of a number of other classical results, and it was also claimed to be equivalent to Shannon's 1959 cone packing bound. In this paper, we investigate methods for a reliable numerical evaluation of the bound, which is troublesome even for not too large values of the block-length n, by compactly expressing the Polyanskiy, Poor, and Verdú (PPV) converse bound in terms of non-central chi-squared distributions, and by evaluating those through an integral expression and a corresponding series expansion which exploit a method proposed by Temme. As a result, a robust evaluation method and new insights on the bound's asymptotics, as well as new approximate expressions, are obtained.
反函数的泰勒展开式及其在 Langevin 函数中的应用
影响因子：
2.6
作者：
Itskov;Dargazany;R. &Hörnes
通讯作者：
R. &Hörnes