A note on the dispersion of network problems
A note on the dispersion of network problems
复制标题
关于网络问题分散的说明
DOI：
10.1109/eeei.2012.6376904
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
U. Erez
中科院分区：
文献类型：
--
作者：
Eli Haim;Yuval Kochman;U. Erez
最近，人们对不同环境下有限块长度性能的分析产生了浓厚的兴趣。具体而言，有一个努力，以扩大性能界限，以及高斯近似（色散）超越点对点设置。这被证明是一项艰巨的任务，因为性能可能受到多个相关约束的制约。在这项工作中，我们阐明了这些困难，使用多路访问通道作为测试用例。我们表明，分散的地方概念是更翔实的分散区域后，寻求迄今为止。在积极的一面，我们表明，具有一定的对称性的信道，分散问题减少到单用户之一。此外，对于这样的信道，线性码使得能够将单用户可扩展性界限转换到多址信道。
Recently there has been significant interest in the analysis of finite-blocklength performance in different settings. Specifically, there is an effort to extend the performance bounds, as well as the Gaussian approximation (dispersion) beyond point-to-point settings. This proves to be a difficult task, as the performance may be governed by multiple dependent constraints. In this work we shed light on these difficulties, using the multiple-access channel as a test case. We show that a local notion of dispersion is more informative than that of dispersion regions sought after thus far. On the positive side, we show that for channels possessing certain symmetry, the dispersion problem reduces to the single-user one. Furthermore, for such channels, linear codes enable to translate single-user achievability bounds to the multiple-access channel.