IEEE International Conference on Communication Technology (ICCT)

Parity-Check Aided Adaptive Successive Cancellation List Decoding for Polar Codes

Jie Zhang, Houdong Xu, Linhao Zhang, Ning Fu, Tu Bin, Li Li

Published Oct 13, 2021• 0 citations

Abstract

In this paper, the fundamental parity-check (PC) mechanism is incorporated into the adaptive successive cancellation list (ASCL) polar decoder and a joint detection is implemented. The generation and distribution methods of the PC bits are specifically designed according to a channel reliability conducted multi protection level principle. Benefiting from these specific designs, the PC aided ASCL decoder becomes an excellent candidate for the parity check concatenated (PCC) polar decoders. The simulation results demonstrate that the proposed decoder achieves the same error-performance as the cyclic redundant check (CRC) aided ASCL decoder but having significantly lower decoding complexity.

DOI: 10.1109/icct52962.2021.9658098

Related papers

Improved Polar SCL Decoding by Exploiting the Error Correction Capability of CRC

Xijin Liu, Shaohua Wu, Xiao Mei Xu +2 more

Novel successive cancellation list (SCL) decoding schemes of Polar codes by exploiting the error correction (EC) capability of the cyclic redundancy check (CRC) codes are proposed in this paper. Different from the schemes in the literature that only considered the error detection capability of CRC, the proposed schemes aim to improve the performance of CRC-aided Polar decoding to the most by benefiting from the potential EC capability of CRC. Specifically, we first propose a basic decoding scheme, named CRC error-correction-aided successive cancellation list (CRC-EC-SCL) decoding, by introducing the look-up-table-based CRC EC method into the Polar SCL decoding process. Then, based on the basic scheme, we further propose the segmented-CRC-EC-SCL decoding scheme. By segmented-CRC, the information block is divided into multiple segments and each segment is attached with a shorter CRC sequence. By conducting the CRC-EC-aided coding for each of the segments, multiple erroneous bits can be corrected early and error propagation can, thus, be efficiently suppressed. The simulation results show that both of the proposed decoding schemes have a significant performance gain over the classic CRC-EC-SCL decoding scheme. Especially for the segmented-CRC-EC-SCL, the performance gain at a frame error rate of 10−4is about 0.4 dB. Moreover, the average computation complexity of the segmented-CRC-EC-SCL is close to the classic scheme.

IEEE AccessDec 28, 201827 citations

CRC Code Design for List Decoding of Polar Codes

Qingshuang Zhang, Aijun Liu, Xiaofei Pan +1 more

Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD) makes polar codes competitive with the state-of-art codes. In this letter, we try to find the optimal CRC for polar codes to further improve its performance. We first analyze the undetected error probability of CRC-aided SCLD as well as the characteristics of Hamming weight distribution of polar codes. Based on these characteristics, a multilevel SCLD-based searching strategy with moderate list size is proposed to compute the minimum Hamming weight distribution (MHWD) of different CRC-concatenated polar codes. Using the searched MHWD, the optimal CRC for polar codes are presented in this letter. Simulation results show that the performance of optimal CRC-aided SCLD significantly outperforms the standard one, especially at high code rate.

IEEE Communications LettersFeb 22, 201796 citations

An Improved CA-SCL Decoding Algorithm for Polar Code

Yunfei Tai, Kezhen Li, Liang Zhou +2 more

An improved CA-SCL (CRC-Aided Successive Cancellation List) decoding algorithm for Polar codes is proposed in this paper. By introducing the global cyclic redundancy check and local parity check, a lower bit error rate is obtained comparing with the known results. The new algorithm constructs a prune decoding path by the parity check in the local processing. Since the parity check can only detect an odd number of errors, the global CRC is used to increase the error detection ability and the decoding accuracy. The performance of the improved decoding algorithm is better than the known results, especially when the code length is either less than or equal to 512, and the code rate is not greater than 0.5 in case of the signal-to-noise ratio (SNR) higher than 3dB. In particular, when the code length is 256 with code rate of 0.5 and decoding list size of 32 under the condition of bit error rate 10-5on the AWGN channel, the proposed algorithm has around 0.25dB and 0.55dB performance gain comparing with that of the CA-SCL and SCL algorithms, respectively.

International Symposium on Networks, Computers and Communications (ISNCC)Jul 19, 20223 citations

Post-Processing for CRC-Aided Successive Cancellation List Decoding of Polar Codes

Chung-Hsuan Wang, Yaoxin Pan, Yu-Heng Lin +1 more

In this letter, three post-processing schemes for cyclic redundancy check (CRC-)aided successive cancellation list (CA-SCL) decoding are presented for polar codes. The re-decoding based on our post-processing schemes can effectively alleviate both the channel and decision errors encountered via CA-SCL decoding. Simulation results show that our schemes perform better than conventional re-decoding schemes and can be incorporated into a polar decoder that has a small list size to achieve a performance that is expected for a large list size.

IEEE Communications LettersApr 9, 202010 citations

Location Design of Multiple Cyclic Redundancy Checks for Polar Codes in Successive Cancellation List Decoding

Hongxu Jin, Rongke Liu

Cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoding algorithm has brought good error performance. Recently, some researchers utilized multiple CRC codes to reduce decoding complexity of CA-SCL decoding algorithm. However, based on CA-SCL decoding frame, we not only reduce decoding complexity but also improve error performance. We divide polar codeword into independent sub-blocks during the process of encoding. Meanwhile, locations of multiple CRC are optimized according to a value of each average Bhattacharyya parameter. Finally, for CA-SCL decoding, results indicate that our constructed polar codes show an admirable error performance and low decoding complexity than that of equal sub-block codewords.

IEEE/CIC International Conference on Communications in China (ICCC)Aug 1, 20181 citation

Improved Adaptive Successive Cancellation List Decoding of Polar Codes

Xiumin Wang, Jinlong He, Jun Li +3 more

Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result and re-decode by increasing L, where L is the size of list. When CRC fails, these two algorithms waste useful information from the previous decoding. In this paper, a simplified adaptive successive cancellation list (SAD-SCL) is proposed. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits, and then re-decoding starts at the incorrect bit with the smallest index in this range. Moreover, when the segmented information sequence cannot get the correct result of decoding, the SAD-SCL algorithm uses SC decoding to complete the decoding of the subsequent segmentation information sequence. Furthermore, its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD-SCL algorithm. The simulation results show that the SAD-SCL algorithm has lower computational complexity than AD-SCL and SCAD-SCL with negligible loss of performance.

EntropySep 17, 20193 citations