• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International ITG Conference on Systems, Communications and Coding >On the Performance of Short Tail-Biting Convolutional Codes for Ultra-Reliable Communications
【24h】

On the Performance of Short Tail-Biting Convolutional Codes for Ultra-Reliable Communications

机译：关于超可靠通信短尖尖卷积码的性能

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Motivated by the increasing interest in powerful short channel codes for low-latency ultra-reliable communications, we analyze the performance of tail-biting convolutional codes with different memories, block lengths and code rates over the additive white Gaussian noise channel. The analysis is carried out both through Monte Carlo simulations and by upper bounding the error probability via Poltyrev's tangential sphere bound at very low error rates. For the simulations, the near maximum likelihood wrap-around Viterbi algorithm is considered. We then compare the performance of tail-biting convolutional codes both with finite-length performance bounds and with that of other channel codes that have been recently considered for ultra-reliable satellite telecommand links. For the shortest block lengths, tail-biting convolutional codes outperform significantly state-of-the-art iterative coding schemes, while as expected their performance degrades visibly with increasing block lengths.
机译：通过对低延迟超可靠通信的强大短信码的兴趣日益增加的动力，我们分析了在附加白色高斯噪声通道上的不同存储器，块长度和码率的尾尖卷积码的性能。通过Monte Carlo仿真和通过Polyrev的切线球在非常低的误差速率下绑定的误差概率来进行分析。对于模拟，考虑了近最大似然包装围绕维特比算法。然后，我们将尾尖卷积码的性能与有限长度的性能界限进行了比较，并且具有最近被考虑的其他通道代码的性能，这些代码最近被考虑用于超可靠的卫星电信连接链路。对于最短的块长度，尾尖卷积码优于最先进的迭代编码方案，而随着预期的性能随着块长度的增加而降低。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号