中国邮电高校学报(英文) ›› 2017, Vol. 24 ›› Issue (2): 83-88.doi: 10.1016/S1005-8885(17)60202-4

• Others • 上一篇    下一篇

Multiple CRC-aided variable successive cancellation list decoder of polar codes

曹妙,赵爽,赵生妹   

  1. 南京邮电大学
  • 收稿日期:2016-09-13 修回日期:2017-04-04 出版日期:2017-04-30 发布日期:2017-04-30
  • 通讯作者: 赵生妹 E-mail:zhaosm@njupt.edu.cn
  • 基金资助:
    中国国家自然科学基金;教育部宽带无线通信与传感器网络技术重点实验室开放研究基金

Multiple CRC-aided variable successive cancellation list decoder of polar codes

  • Received:2016-09-13 Revised:2017-04-04 Online:2017-04-30 Published:2017-04-30
  • Supported by:
    the National Natural Science Foundation of China (61475075,61271238), the Open Research Fund of Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Ministry of Education (NYKL2015011).

摘要: In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number.

关键词: polar codes, successive cancellation list decoder, cyclic redundancy check, list path, variable list size

Abstract: In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number.

Key words: polar codes, successive cancellation list decoder, cyclic redundancy check, list path, variable list size