Sphere decoder for polar codes concatenated with cyclic redundancy check  

作　　者：Yongrun YU Zhiwen PAN Nan LIU Xiaosi TAN 

机构地区：[1]National Mobile Communications Research Laboratory, Southeast University

出　　处：《Science China(Information Sciences)》2019年第8期155-167,共13页中国科学（信息科学）（英文版）

基　　金：supported by National Major Project (Grant No. 2017ZX03001002-004);National Natural Science Foundation Project (Grant No. 61521061);National Natural Science Foundation of China (Grant No. 61571123);333 Program of Jiangsu (Grant No. BRA2017366)

摘　　要：The existing cyclic redundancy check(CRC)-aided successive cancellation list(CA-SCL) decoder partitions the decoding process into two steps, where an SCL is followed by a CRC check. An SCL decoder can approach the maximum-likelihood(ML) decoding performance of the inner polar codes using a sufficiently large list;however, in this case, CRC is only used for performing error detection. Therefore, the decoding performance of the outer CRC is different from that of ML because the errors are not rectified, which degrades the performance of the entire concatenated codes. In this study, we propose a sphere decoder(SD) that can achieve the ML performance of polar codes concatenated with CRC to address the suboptimality of CASCL decoding. The proposed SD performs joint decoding of the CRC-polar codes in a single step, thereby avoiding the polar decoding and CRC detection decoding scheme. Because the proposed SD guarantees the ML decoding performance of the CRC-polar concatenated codes, the simulation results demonstrate that the block error rate(BLER) of the proposed SD acts as the lower bound of the CA-SCL decoding performance. Further, a new initial radius selection method is proposed for the SD to reduce the average decoding complexity. The simulations demonstrate that the proposed initial radius selection method reduces more amount of decoding complexity when compared with that reduced using sequential step size methods.The existing cyclic redundancy check(CRC)-aided successive cancellation list(CA-SCL) decoder partitions the decoding process into two steps, where an SCL is followed by a CRC check. An SCL decoder can approach the maximum-likelihood(ML) decoding performance of the inner polar codes using a sufficiently large list; however, in this case, CRC is only used for performing error detection. Therefore, the decoding performance of the outer CRC is different from that of ML because the errors are not rectified, which degrades the performance of the entire concatenated codes. In this study, we propose a sphere decoder(SD) that can achieve the ML performance of polar codes concatenated with CRC to address the suboptimality of CASCL decoding. The proposed SD performs joint decoding of the CRC-polar codes in a single step, thereby avoiding the polar decoding and CRC detection decoding scheme. Because the proposed SD guarantees the ML decoding performance of the CRC-polar concatenated codes, the simulation results demonstrate that the block error rate(BLER) of the proposed SD acts as the lower bound of the CA-SCL decoding performance. Further, a new initial radius selection method is proposed for the SD to reduce the average decoding complexity. The simulations demonstrate that the proposed initial radius selection method reduces more amount of decoding complexity when compared with that reduced using sequential step size methods.

关 键 词：polar codes SPHERE DECODER MAXIMUM-LIKELIHOOD DECODING optimal DECODING RADIUS search 

分 类 号：TP[自动化与计算机技术]