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

IEEE Communications Letters

Enhanced List Decoding of Long Polar Codes Through Efficient Perturbation

Zhongjun Yang

Published Jan 1, 2026• 1 citation
Publisher

Abstract

Soft information perturbation can significantly enhance the successive cancellation list (SCL) decoding performance of polar codes. However, the existing perturbation-based SCL (PSCL) decoding requires a large number of re-decoding attempts, leading to high decoding complexity, and hence limits its application for long polar codes. In this letter, an enhanced PSCL (E-PSCL) decoding is proposed. It utilizes a new biased perturbation strategy that requires a reduced number of redecoding attempts, but yields an advanced decoding performance. To further improve the E-PSCL decoding performance, a reliability metric (RM) is introduced. It can better identify the possibly erroneous positions within the SCL decoding failures. During each decoding attempt, the E-PSCL decoding takes turns to flip these positions. Moreover, for the RM, it is derived from the SCL decoding error probability for which both the frozen bits and the error propagation are considered. Simulation results show that with the same number of decoding attempts, the proposed E-PSCL decoding outperforms the state-of-the-art dynamic SCL flip (D-SCLF) decoding and the conventional PSCL decoding.

DOI
10.1109/lcomm.2026.3674547

Related papers

Successive Cancellation List Flip Decoding for eBCH-polar Codes

Wei-Cheng Wang, Meng-Ru Wu, Shan Lu +2 more

The eBCH-polar codes is a powerful way to construct polar codes. With high minimum Hamming distance, it outperforms ordinary Polar codes under successive cancellation list (SCL) decoder. However, the absence of cyclic redundancy check (CRC) bits in eBCH-polar codes makes it challenging to adopt SCL-flip (SCLF) decoding scheme. In this research, we propose a flip scheme activated by a Normalized Path Metric (PM) range and a mismatch criterion, which respectively leverage the properties of SCL decoding and dynamic frozen bits of eBCH-polar codes. This work also improves the selection the flipping bits by modifying metric to account for the structure of dynamic frozen bits and reduce the search space. Based on these modifications, we proposed SCLF-1 and SCLF-2 decoding algorithms for eBCH-polar codes. Simulation results show that both of the proposed decoding schemes achieve superior performance compared to other contemporary decoding algorithms for CRC aided polar (CA-polar) codes, demonstrating enhanced error rates performance within the same decoding attempt.

IEEE Vehicular Technology Conference•Oct 19, 2025•0 citations

Improved Successive Cancellation Decoding of Long Polar Codes Through Perturbing a Posteriori LLRs and Its Theoretical Insights

Zhongjun Yang, Li Chen, Xianbin Wang +1 more

For polar codes, perturbing received information can enhance the successive cancellation (SC) decoding performance. This is an effective approach for realizing low-latency yet high performance for long polar codes, since all the perturbation-enhanced SC (PSC) decoding can be performed in parallel. This paper provides theoretical insights into soft information perturbation, revealing that the PSC decoding can be equivalently interpreted as perturbing thea posteriorilog-likelihood ratios (LLRs) of information bits. Such a revelation leads to the design of an improved PSC (IPSC) decoding that yields a lower perturbation complexity. By better utilizing the decodinga posterioriLLRs, a set of possibly erroneous estimations can be formed and further perturbed, resulting in the proposed hybrid PSC (HPSC) decoding. During each new SC decoding attempt, it takes turns to flip the first erroneous bit by introducing a biased perturbation, while the subsequent erroneous estimations are corrected through random perturbations. Our simulation results validate that, for various codeword lengths and rates, the proposed IPSC decoding can achieve a similar performance as the conventional PSC decoding, but yield a significantly reduced perturbation complexity. With the same number of decoding attempts, the proposed HPSC decoding outperforms several state-of-the-art SC-based decoding, such as the thresholded SC-flip (TSCF) decoding and the dynamic SC-flip (DSCF) decoding.

IEEE Transactions on Communications•Jan 1, 2026•2 citations

An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes

Desheng Wang, Jihang Yin, Yonggang Xu +3 more

Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.

Mathematics•Oct 27, 2023•2 citations

Adaptive Perturbation Enhanced SCL Decoder for Polar Codes

Xianbin Wang, Huazi Zhang, Jiajie Tong +2 more

For polar codes, successive cancellation list (SCL) decoding algorithm significantly improves finite-length performance compared to SC decoding. SCL-flip decoding can further enhance the performance but the gain diminishes as code length increases, due to the difficulty in locating the first error bit position. In this work, we introduce an SCL-perturbation decoding algorithm to address this issue. A basic version of the algorithm introduces small random perturbations to the received symbols before each SCL decoding attempt, and exhibits non-diminishing gain at large block lengths. Its enhanced version adaptively performs random perturbations or directional perturbation on each received symbol according to previous decoding results, and managed to correct more errors with fewer decoding attempts. Extensive simulation results demonstrate stable gains across various code rates, lengths and list sizes. To the best of our knowledge, this is the first SCL enhancement with non-diminishing gains as code length increases, and achieves unprecedented efficiency. With only one additional SCL-$L$ decoding attempt (in total two), the proposed algorithm achieves SCL-$2L$-equivalent performance. Since the gain is obtained without increasing list size, the algorithm is best suited for hardware implementation.

arXiv:2407.03555•Jul 4, 2024•3 citations

Efficient Perturbation-Based SC Decoding for Long Polar Codes

Zhongjun Yang, Z. Liu, Li Chen +2 more

Soft information perturbations can significantly improve the successive cancellation (SC) decoding performance of polar codes. This is an effective method for realizing low-latency yet high performance for long polar codes, since each perturbation-based SC (PSC) decoding can be performed in parallel. However, little theoretical insight has been revealed so far regarding its work rationale. This paper provides the theoretical analysis of the soft information perturbation. It reveals that PSC decoding improves the SC decoding performance through correcting the erroneous bit estimations, especially the first erroneous bit (FEB). It further validates that perturbing the soft information does not degrade the error-correction capability of SC decoding. Such revelations lead to the design of optimal perturbations that maximizes the FEB correction probability, resulting in an enhanced PSC decoding performance. Based on this, a novel hybrid PSC (HPSC) decoding is proposed. By introducing the random and biased perturbations, the HPSC decoding can better divert from the initial erroneous estimation and converge to the intended one. Our simulation results demonstrate that with the optimal perturbation, the HPSC decoding can achieve a similar performance as the cyclic redundancy check (CRC) aided SC list (CA-SCL) decoding, while avoiding path sorting and expansion.

arXiv:2610.27744•Oct 20, 2026•0 citations

Improved generalized successive cancellation list flip decoder of polar codes with fast decoding of special nodes

Fedor I. Ivanov, Valerii Morishnik, Evgenii A. Krouk

In this paper, an improvement for SC list flip (SCL-Flip) decoding is presented for polar codes. A novel bit-selection metric for critical set (set of information symbols of polar codes being flipped during additional decoding attempts) based on path metric of successive cancellation list (SCL) decoding is suggested. With the proposed metric, the improved SCL scheme based on special nodes (SN) decoders was developed. This decoder will be denoted by GSCLF. The main idea of the proposed decoder is joint using of two approaches: first one is a fast decoding of special nodes in binary tree representation of polar code (e.g., some special nodes in tree representation of polar code that allow efficient list decoding with low complexity) and the second one is an applying of additional decoding attempts (flips) in the case when initial decoding was erroneous. The simultaneous use of these two approaches results in both a significant reduction in spatial complexity and a significant reduction in the number of computations required for decoding whereas keeping excellent performance. Simulation results presented in this paper allow us to conclude that the computational complexity of the proposed GSCLF decoder is from 66% to 80% smaller than the one of SCL-32 decoder.

Journal of Communications and Networks•Dec 1, 2021•23 citations
Soft information perturbation can significantly enhance the successive cancellation list (SCL) decoding performance of polar codes. However, the existing perturbation-based SCL (PSCL) decoding requires a large number of re-decoding attempts, leading to high decoding complexity, and hence limits its application for long polar codes. In this letter, an enhanced PSCL (E-PSCL) decoding is proposed. It utilizes a new biased perturbation strategy that requires a reduced number of redecoding attempts, but yields an advanced decoding performance. To further improve the E-PSCL decoding performance, a reliability metric (RM) is introduced. It can better identify the possibly erroneous positions within the SCL decoding failures. During each decoding attempt, the E-PSCL decoding takes turns to flip these positions. Moreover, for the RM, it is derived from the SCL decoding error probability for which both the frozen bits and the error propagation are considered. Simulation results show that with the same number of decoding attempts, the proposed E-PSCL decoding outperforms the state-of-the-art dynamic SCL flip (D-SCLF) decoding and the conventional PSCL decoding.
The eBCH-polar codes is a powerful way to construct polar codes. With high minimum Hamming distance, it outperforms ordinary Polar codes under successive cancellation list (SCL) decoder. However, the absence of cyclic redundancy check (CRC) bits in eBCH-polar codes makes it challenging to adopt SCL-flip (SCLF) decoding scheme. In this research, we propose a flip scheme activated by a Normalized Path Metric (PM) range and a mismatch criterion, which respectively leverage the properties of SCL decoding and dynamic frozen bits of eBCH-polar codes. This work also improves the selection the flipping bits by modifying metric to account for the structure of dynamic frozen bits and reduce the search space. Based on these modifications, we proposed SCLF-1 and SCLF-2 decoding algorithms for eBCH-polar codes. Simulation results show that both of the proposed decoding schemes achieve superior performance compared to other contemporary decoding algorithms for CRC aided polar (CA-polar) codes, demonstrating enhanced error rates performance within the same decoding attempt.
For polar codes, perturbing received information can enhance the successive cancellation (SC) decoding performance. This is an effective approach for realizing low-latency yet high performance for long polar codes, since all the perturbation-enhanced SC (PSC) decoding can be performed in parallel. This paper provides theoretical insights into soft information perturbation, revealing that the PSC decoding can be equivalently interpreted as perturbing thea posteriorilog-likelihood ratios (LLRs) of information bits. Such a revelation leads to the design of an improved PSC (IPSC) decoding that yields a lower perturbation complexity. By better utilizing the decodinga posterioriLLRs, a set of possibly erroneous estimations can be formed and further perturbed, resulting in the proposed hybrid PSC (HPSC) decoding. During each new SC decoding attempt, it takes turns to flip the first erroneous bit by introducing a biased perturbation, while the subsequent erroneous estimations are corrected through random perturbations. Our simulation results validate that, for various codeword lengths and rates, the proposed IPSC decoding can achieve a similar performance as the conventional PSC decoding, but yield a significantly reduced perturbation complexity. With the same number of decoding attempts, the proposed HPSC decoding outperforms several state-of-the-art SC-based decoding, such as the thresholded SC-flip (TSCF) decoding and the dynamic SC-flip (DSCF) decoding.
Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.
For polar codes, successive cancellation list (SCL) decoding algorithm significantly improves finite-length performance compared to SC decoding. SCL-flip decoding can further enhance the performance but the gain diminishes as code length increases, due to the difficulty in locating the first error bit position. In this work, we introduce an SCL-perturbation decoding algorithm to address this issue. A basic version of the algorithm introduces small random perturbations to the received symbols before each SCL decoding attempt, and exhibits non-diminishing gain at large block lengths. Its enhanced version adaptively performs random perturbations or directional perturbation on each received symbol according to previous decoding results, and managed to correct more errors with fewer decoding attempts. Extensive simulation results demonstrate stable gains across various code rates, lengths and list sizes. To the best of our knowledge, this is the first SCL enhancement with non-diminishing gains as code length increases, and achieves unprecedented efficiency. With only one additional SCL-LLL decoding attempt (in total two), the proposed algorithm achieves SCL-2L2L2L-equivalent performance. Since the gain is obtained without increasing list size, the algorithm is best suited for hardware implementation.
Soft information perturbations can significantly improve the successive cancellation (SC) decoding performance of polar codes. This is an effective method for realizing low-latency yet high performance for long polar codes, since each perturbation-based SC (PSC) decoding can be performed in parallel. However, little theoretical insight has been revealed so far regarding its work rationale. This paper provides the theoretical analysis of the soft information perturbation. It reveals that PSC decoding improves the SC decoding performance through correcting the erroneous bit estimations, especially the first erroneous bit (FEB). It further validates that perturbing the soft information does not degrade the error-correction capability of SC decoding. Such revelations lead to the design of optimal perturbations that maximizes the FEB correction probability, resulting in an enhanced PSC decoding performance. Based on this, a novel hybrid PSC (HPSC) decoding is proposed. By introducing the random and biased perturbations, the HPSC decoding can better divert from the initial erroneous estimation and converge to the intended one. Our simulation results demonstrate that with the optimal perturbation, the HPSC decoding can achieve a similar performance as the cyclic redundancy check (CRC) aided SC list (CA-SCL) decoding, while avoiding path sorting and expansion.
In this paper, an improvement for SC list flip (SCL-Flip) decoding is presented for polar codes. A novel bit-selection metric for critical set (set of information symbols of polar codes being flipped during additional decoding attempts) based on path metric of successive cancellation list (SCL) decoding is suggested. With the proposed metric, the improved SCL scheme based on special nodes (SN) decoders was developed. This decoder will be denoted by GSCLF. The main idea of the proposed decoder is joint using of two approaches: first one is a fast decoding of special nodes in binary tree representation of polar code (e.g., some special nodes in tree representation of polar code that allow efficient list decoding with low complexity) and the second one is an applying of additional decoding attempts (flips) in the case when initial decoding was erroneous. The simultaneous use of these two approaches results in both a significant reduction in spatial complexity and a significant reduction in the number of computations required for decoding whereas keeping excellent performance. Simulation results presented in this paper allow us to conclude that the computational complexity of the proposed GSCLF decoder is from 66% to 80% smaller than the one of SCL-32 decoder.