...
首页> 外文期刊>IEEE Transactions on Signal Processing >Convolutional Neural Network-Aided Tree-Based Bit-Flipping Framework for Polar Decoder Using Imitation Learning
【24h】

Convolutional Neural Network-Aided Tree-Based Bit-Flipping Framework for Polar Decoder Using Imitation Learning

机译:基于卷积神经网络辅助树的极性解码器使用模仿学习的基于树的比特翻转框架

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

获取外文期刊封面封底 >>

       

摘要

Known for their capacity-achieving abilities and low complexity for both encoding and decoding, polar codes have been selected as the control channel coding scheme for 5G communications. To satisfy the needs of high throughput and low latency, belief propagation (BP) is chosen as the decoding algorithm. However, it suffers from worse error performance than that of cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL). Recently, convolutional neural network-aided bit-flipping (CNN-BF) is applied to BP decoding, which can accurately identify the erroneous bits to achieve a better error rate and lower decoding latency than prior critical-set bit-flipping (CS-BF) mechanism. However, successive BF, having better error correction capability, has not been explored in CNN-BF since the more complicated flipping strategy is out of the scope of supervised learning. In this work, by using imitation learning, a convolutional neural network-aided tree-based multiple-bits BF (CNN-Tree-MBF) mechanism is proposed to explore the benefits of multiple-bits BF. With the CRC information as additional input data, the proposed CNN-BF model can further reduce 5 flipping attempts. Besides, a tree-based flipping strategy is proposed to avoid useless flipping attempts caused by wrongly flipped bits. From the simulation results, our approach can outperform CS-BF and reduce flipping attempts by 89% when code length is 64, code rate is 0.5 and SNR is 1 dB. It also achieves a comparable block error rate (BLER) as CA-SCL.
机译:以其容量实现的能力和对编码和解码的低复杂性而闻名,已经选择了极性代码作为5G通信的控制信道编码方案。为了满足高吞吐量和低延迟的需要,选择信仰传播(BP)作为解码算法。但是,它的错误性能遭受了比循环冗余校验(CRC)的连续取消列表(CA-SCL)的错误性能。最近,将卷积神经网络辅助位翻转(CNN-BF)应用于BP解码,这可以精确地识别错误的比特,以实现比先前关键集合位翻转的更好的错误率和更低的解码延迟(CS-BF ) 机制。然而,在CNN-BF中尚未在CNN-BF中探讨了具有更好纠错能力的BF,因为更复杂的翻转策略超出了监督学习的范围。在这项工作中,通过使用模仿学习,提出了一种基于卷积神经网络辅助树的多比特(CNN-Tree-MBF)机制,以探索多位BF的益处。使用CRC信息作为额外的输入数据,所提出的CNN-BF模型可以进一步降低5次翻转尝试。此外,提出了一种基于树的翻转策略,以避免由错误翻转的比特引起的无用翻转尝试。从仿真结果中,当代码长度为64时,我们的方法可以优于CS-BF并减少翻转尝试89%,码率为0.5,SNR为1 dB。它还实现了与CA-SCL相当的块错误率(BLER)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号