Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Electronics, Integrated Circuits and Communication Technology (EICCT)

Complexity-Aware Parity-Check Aided CRC-SCL Decoding for Polar Codes

Chao Jiang, Hua Wei

Published Apr 24, 2026• 0 citations
Publisher
DOI
10.1109/eicct69950.2026.11564062

Related papers

List-Pruning SCL Decoder for Polar Codes Using Parity-Check Bits

Yusuke Oki, Ryo Shibata, Hiroyuki Yashima

IEICE Technical Report; IEICE Tech. Rep.•Feb 25, 2021•0 citations

Low-Complexity SCL Decoding for Polar Codes: A Selective Computation Approach

Mohamed Lamrini, Zakarea Rahou, Akharraz Ismail +1 more

Lecture notes in networks and systems•Oct 7, 2025•0 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, 2022•3 citations

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 Access•Dec 28, 2018•27 citations

CRC Design for List Decoding of Polar Codes

Takumi MURATA, Hideki Ochiai

IEICE Technical Report; IEICE Tech. Rep.•Jan 11, 2016•0 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, 2018•1 citation
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.
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.
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.