首页> 外文会议>IEEE Global Communications Conference >Simplified Decoding of Polar Codes by Identifying Reed-Muller Constituent Codes
【24h】

Simplified Decoding of Polar Codes by Identifying Reed-Muller Constituent Codes

机译:通过识别REED-MULLER组成代码简化了极性代码的解码

获取原文

摘要

The throughput of successive cancellation decoding of polar codes can be improved through simplified decoders that identify specific constituent codes in the decoding tree. The identified codes include rate-0, rate-1, repetition, and single parity-check codes. In this work, constituent codes that belong to the family of first-order Reed-Muller codes, and their sub-codes, are also identified in the decoding tree. Alternative decoding schemes that utilize the structure of Reed-Muller codes are incorporated into successive cancellation decoding. Simulation results show that such an approach can improve both the block error rate performance as well as the decoding latency of polar codes.
机译:通过识别解码树中的特定组成代码的简化解码器,可以改善连续取消解码的吞吐量。所识别的代码包括速率-0,速率-1,重复和单个奇偶校验码。在这项工作中,还在解码树中识别属于一阶Reed-Muller码的组成代码及其子码。利用Reed-Muller码结构的替代解码方案结合到连续的消除解码中。仿真结果表明,这种方法可以改善块误差率性能以及极性代码的解码等待时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号