...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Communications >Improved Successive Cancellation Decoding of Polar Codes
【24h】

Improved Successive Cancellation Decoding of Polar Codes

机译：改进的极坐标码相继对消解码

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

摘要

As improved versions of the successive cancellation (SC) decoding algorithm, the successive cancellation list (SCL) decoding and the successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. In this paper, unified descriptions of the SC, SCL, and SCS decoding algorithms are given as path search procedures on the code tree of polar codes. Combining the principles of SCL and SCS, a new decoding algorithm called the successive cancellation hybrid (SCH) is proposed. This proposed algorithm can provide a flexible configuration when the time and space complexities are limited. Furthermore, a pruning technique is also proposed to lower the complexity by reducing unnecessary path searching operations. Performance and complexity analysis based on simulations shows that under proper configurations, all the three improved successive cancellation (ISC) decoding algorithms can approach the performance of the maximum likelihood (ML) decoding but with acceptable complexity. With the help of the proposed pruning technique, the time and space complexities of ISC decoders can be significantly reduced and be made very close to those of the SC decoder in the high signal-to-noise ratio regime.
机译：作为连续消除（SC）解码算法的改进版本，连续消除列表（SCL）解码和连续消除栈（SCS）解码用于改善极性码的有限长度性能。在本文中，对SC，SCL和SCS解码算法的统一描述作为极坐标代码树上的路径搜索过程给出。结合SCL和SCS的原理，提出了一种新的解码算法，称为连续消除混合（SCH）。当时间和空间复杂度受到限制时，该算法可以提供灵活的配置。此外，还提出了一种修剪技术，以通过减少不必要的路径搜索操作来降低复杂度。基于仿真的性能和复杂度分析表明，在适当的配置下，所有三种改进的连续消除（ISC）解码算法都可以达到最大似然（ML）解码的性能，但复杂度可以接受。借助于提出的修剪技术，在高信噪比条件下，ISC解码器的时间和空间复杂度可以大大降低，并且非常接近SC解码器的时间和空间复杂度。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号