...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
【24h】

Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations

机译：有限长度机制中的编码：基于Laplace积分的边界和它们的渐近近似

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi–Poor–Verdù, and are investigated under parallel AWGN channels, the AWGN channel, the BI-AWGN channel, and the BSC. The technique we use, which is a generalization of some recent results available from the literature, is to map the probabilities of interest into a Laplace integral, and then solve (or approximate) the integral by use of a steepest descent technique. The proposed results are particularly useful for short packet lengths, where the normal approximation may provide unreliable results.
机译：在本文中，我们为有限块长形式中的逆和可实现范围提供了新的紧致积分表达式和相关的简单渐近逼近。所选的逆向和随机编码并集范围取材于Polyanskyi–Poor–Verdù的最新工作，并在并行AWGN通道，AWGN通道，BI-AWGN通道和BSC下进行了研究。我们使用的技术是从文献中获得的一些最新结果的概括，是将感兴趣的概率映射到Laplace积分中，然后使用最速下降技术求解（或近似）该积分。所提出的结果对于短分组长度特别有用，其中正常近似可能会提供不可靠的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号