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

Optoelectronics Letters

Partitioned PC-aided SCLF decoding algorithm for polar codes based on error distribution of critical set

Jianguo Yuan, Ziliang Zhu, Deyi Yang, Jinneng Xiang

Published Sep 1, 2026• 0 citations
Publisher
DOI
10.1007/s11801-026-5062-8

Related papers

An improved AS-SCLF decoding algorithm of polar codes based on the assigned set

Wei You, Jianguo Yuan, Linfeng Yu +1 more

Optoelectronics Letters•Nov 1, 2022•3 citations

Study on the aided PC-ASCL decoding algorithm based on optimized parity check codes

Jianguo Yuan, Deyi Yang, Ziliang Zhu +1 more

Optoelectronics Letters•Feb 1, 2026•0 citations

Balanced Low-Complexity and Flexible Error-Correction List Flip Decoding for Polar Codes

Yansong Lv, Dai, Jingxin, Wang, Yuhuan +2 more

Benefiting from performance advantages under short code lengths, polar codes are well-suited for certain scenarios, such as the future Internet of Things (IoT) applications that require high reliability and low power. Existing list flip decoders can efficiently further enhance the error-correction performance of polar codes with finite code lengths, particularly the dynamic successive cancellation list flip (D-SCLF) decoder with flexible high-order error-correction capability (FHECC). However, to the best of our knowledge, current list flip decoders cannot effectively balance complexity and error-correction efficiency. To address this, we propose a parity-check-aided D-SCLF (PC-DSCLF) decoder. This decoder, based on FHECC and the characteristics of the list flip decoding process, introduces a simplified flip metric and a hybrid check scheme, along with a decoding method that supports the check scheme, enabling it to retain FHECC while achieving low complexity. Simulation results show that the proposed PC-DSCLF decoder achieves up to a 51.1\% average complexity reduction compared to the D-SCLF algorithm with distributed CRC for $PC(512, 256+24)$

arXiv:2303.12609•Mar 22, 2023•1 citation

Simplified SCL decoding algorithm of polar codes based on critical sets

Jianguo Yuan, Fengguo Zhang, Jingjie He +1 more

Optoelectronics Letters•Jun 1, 2023•3 citations

Complete State Critical Set Based SCLF Decoding Algorithm for Polar Codes

Wenjie Dai, Rui Guo

The revised critical set (RCS) used by successive cancellation list flip (SCLF) decoding algorithm only retains the unreliable bits of SC state.So, the bits of information in the RCS are not comprehensive enough.Aiming at this problem, this paper proposed a kind of complete state critical set (CSCS) based SCLF decoding algorithm for polar codes.In order to obtain a more complete flipping set of states, the proposed CSCS is constructed according to different path splitting states after pruning.According to different states of CSCS, hard decision and path metric (PM) correction methods are adopted respectively, to cut off the wrong path and keep the correct path, so as to achieve bit flipping function.Experimental results show that compared with the traditional SCLF decoding algorithm, the performance of complete state SCLF (CS-SCLF) decoding algorithm is improved.At the same time, the average flipping number of flips is reduced without loss of decoding performance.

KSII Transactions on Internet and Information Systems•Dec 31, 2024•0 citations

Bit Metrics Based on SCLF Decoding Algorithm for Polar Codes

Haifeng Lin, Rui Guo

As an indispensable part of cyclic redundancy check aided Successive Cancellation List (CA-SCL) decoding and SCL bit flipping (CA-SCLF) decoding, sort operation increases the complexity of decoding.In order to minimize the quantity of sorting and simplify the complexity of SCLF decoding algorithm, this paper proposes an improved SCLF decoding algorithm, called NSCLF algorithm, which reduces the number of paths involved in sorting by detecting and pruning paths whose bit metric value is less than the set threshold before sorting operations.Meanwhile, pruning paths are dynamically selected according to node states during the flipping process.The flipping path selections are more accurate and the number of flipping correspondingly decreases.The simulation results demonstrate that when SNR is 3dB, the code length and code rate , while maintaining decoding performance comparable to that of traditional CA-SCLF, the sorting operation of our proposed NSCLF is about 93% less than that of traditional CA-SCLF, and the decoding complexity is less than that of traditional CA-SCLF.

KSII Transactions on Internet and Information Systems•May 31, 2025•0 citations
Benefiting from performance advantages under short code lengths, polar codes are well-suited for certain scenarios, such as the future Internet of Things (IoT) applications that require high reliability and low power. Existing list flip decoders can efficiently further enhance the error-correction performance of polar codes with finite code lengths, particularly the dynamic successive cancellation list flip (D-SCLF) decoder with flexible high-order error-correction capability (FHECC). However, to the best of our knowledge, current list flip decoders cannot effectively balance complexity and error-correction efficiency. To address this, we propose a parity-check-aided D-SCLF (PC-DSCLF) decoder. This decoder, based on FHECC and the characteristics of the list flip decoding process, introduces a simplified flip metric and a hybrid check scheme, along with a decoding method that supports the check scheme, enabling it to retain FHECC while achieving low complexity. Simulation results show that the proposed PC-DSCLF decoder achieves up to a 51.1\% average complexity reduction compared to the D-SCLF algorithm with distributed CRC for PC(512,256+24)PC(512, 256+24)PC(512,256+24)
The revised critical set (RCS) used by successive cancellation list flip (SCLF) decoding algorithm only retains the unreliable bits of SC state.So, the bits of information in the RCS are not comprehensive enough.Aiming at this problem, this paper proposed a kind of complete state critical set (CSCS) based SCLF decoding algorithm for polar codes.In order to obtain a more complete flipping set of states, the proposed CSCS is constructed according to different path splitting states after pruning.According to different states of CSCS, hard decision and path metric (PM) correction methods are adopted respectively, to cut off the wrong path and keep the correct path, so as to achieve bit flipping function.Experimental results show that compared with the traditional SCLF decoding algorithm, the performance of complete state SCLF (CS-SCLF) decoding algorithm is improved.At the same time, the average flipping number of flips is reduced without loss of decoding performance.
As an indispensable part of cyclic redundancy check aided Successive Cancellation List (CA-SCL) decoding and SCL bit flipping (CA-SCLF) decoding, sort operation increases the complexity of decoding.In order to minimize the quantity of sorting and simplify the complexity of SCLF decoding algorithm, this paper proposes an improved SCLF decoding algorithm, called NSCLF algorithm, which reduces the number of paths involved in sorting by detecting and pruning paths whose bit metric value is less than the set threshold before sorting operations.Meanwhile, pruning paths are dynamically selected according to node states during the flipping process.The flipping path selections are more accurate and the number of flipping correspondingly decreases.The simulation results demonstrate that when SNR is 3dB, the code length and code rate , while maintaining decoding performance comparable to that of traditional CA-SCLF, the sorting operation of our proposed NSCLF is about 93% less than that of traditional CA-SCLF, and the decoding complexity is less than that of traditional CA-SCLF.