首页> 外文学位 >Successive Cancellation List-based Latency and Computational Complexity Reduction for Polar Codes
【24h】

Successive Cancellation List-based Latency and Computational Complexity Reduction for Polar Codes

机译:基于连续取消列表的延迟和极地代码的计算复杂度降低

获取原文
获取原文并翻译 | 示例

摘要

Polar codes provide a promising new direction in channel coding that is expected to play a vital role in 5G wireless cellular communication systems. Successive cancellation list (SCL) decoding, as a widely adopted decoding scheme for polar codes, sacrifices decoding complexity and latency to improve error performance. To address the shortcomings of SCL, a decoding complexity and latency reduction technique, denoted bit skipping and verified to be applicable for most list decoders, is proposed in this thesis. By bypassing unnecessary sorting operations, bit skipping reduced the decoding complexity, for a half rate code, by 27.2% while increasing throughput by 19.1%. A hybrid decoder for decoding complexity reduction was also proposed and was shown to reduce the decoding complexity by up to 97.8% under favorable channel conditions.
机译:极地码为信道编码提供了一个有希望的新方向,有望在5G无线蜂窝通信系统中发挥至关重要的作用。作为极性码的广泛采用的解码方案,连续消除列表(SCL)解码牺牲了解码复杂性和等待时间以提高错误性能。针对SCL的不足,本文提出了一种解码复杂度和等待时间减少的技术,该技术被称为跳比特,并被证明适用于大多数列表解码器。通过跳过不必要的排序操作,对于半速率码,位跳过将解码复杂度降低了27.2%,同时将吞吐量提高了19.1%。还提出了一种用于降低解码复杂度的混合解码器,并被证明在有利的信道条件下可将解码复杂度降低多达97.8%。

著录项

  • 作者

    Li, Zhipeng.;

  • 作者单位

    University of Toronto (Canada).;

  • 授予单位 University of Toronto (Canada).;
  • 学科 Electrical engineering.
  • 学位 M.A.S.
  • 年度 2018
  • 页码 91 p.
  • 总页数 91
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号