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

Journal of IKEEE

Comparison on Recent Decoding Methods for Polar Codes based on Successive-Cancellation Decoding

So Yeon Choi, Ho Young Yoo

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.7471/ikeee.2020.24.2.550

Related papers

Recent Successive Cancellation Decoding Methods for Polar Codes

So‐Yeon Choi, Youngjoo Lee, Hoyoung Yoo

•Jan 1, 2020•0 citations

Decoding schedule generating method for successive‐cancellation decoder of polar codes

Dan Le, Xianyan Wu, Xiamu Niu

Successive cancellation (SC) is the first and widely known decoder of polar codes, which has received a lot of attentions. However, its decoding schedule generating methods are still primitive. Based on a newly found factor, this study proposes an online method to generate the decoding schedule of SC decoder by a non‐recursive way. The decoding schedule of SC decoder includes two parts. One is to determine which of likelihood ratios (LRs) can be shared and which of LRs need to be calculated. The other is to select a calculation formula for a LR to be computed. As shown by the comparisons among the proposed method and existing methods, the proposed method solves the first part of the decoding schedule with constant critical path delay and lower space complexity, and solves the second part of the decoding schedule with less calculations. Besides, experimental results show that the proposed method does not affect the error performance of polar codes.

IET Communications•Feb 23, 2016•6 citations

Simplified Successive Cancellation List Decoding of ABS+ Polar Codes

Mikhail Chernikov, Peter Trifonov

Recently invented ABS+ polar codes provide substantially faster polarization than classical polar codes. We present the simplified version of SCL decoding for ABS+ polar codes that implements the idea of pruning of the recursion tree in the successive algorithm. The proposed fast simplified SCL (FSSCL) decoder provides better tradeoff between performance and arithmetic complexity than FSSCL decoder of classical polar codes. It also experiences lower latency in comparison with polar codes with large kernels under window processing (WP) based decoding while the performance and complexity are the same.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

On Successive Cancellation Decoding of Polar Codes and Related Codes

Christian Schürch

•Jan 1, 2016•4 citations

Neural Successive Cancellation List Decoding of Polar Codes

Stefano Negrini, Velio Tralli

Neural Network Decoders (NNDs) have been recently considered and investigated as an alternative to the classical algorithms for decoding Polar Codes. In particular, a class of partitioned decoders has been proposed where modified Successive Cancellation (SC) or Belief Propagation (BP) algorithms exploit the neural network decoding of short sublocks. Although NNDs work as one-shot decoders with small decoding latency, the performance of these decoders, in comparison with classic approaches, still suffers from some losses; this fact limits their application to codes with short/medium length. In this article we introduce the novel Neural Successive Cancellation List (NSCL) decoder, as a partitioned version of the SC decoder operating on a list of L multiple decoding candidates that are built with the decoded sub-blocks obtained from a set of NNDs working in parallel at each partition. This decoder significantly improves the BER performance of the non-list version under the same code length. Hence, it reduces the intrinsic loss of performance given by the use of NNDs and allows the application of NN-based decoding to longer codewords.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•1 citation

Successive Cancellation Decoding of Polar Codes : Channel Synthesis and Decomposition

Moon-Ho Lee, Jun Li, Juyong M. Park

Journal of the Institute of Electronics Engineers of Korea•Jan 1, 2011•0 citations
Successive cancellation (SC) is the first and widely known decoder of polar codes, which has received a lot of attentions. However, its decoding schedule generating methods are still primitive. Based on a newly found factor, this study proposes an online method to generate the decoding schedule of SC decoder by a non‐recursive way. The decoding schedule of SC decoder includes two parts. One is to determine which of likelihood ratios (LRs) can be shared and which of LRs need to be calculated. The other is to select a calculation formula for a LR to be computed. As shown by the comparisons among the proposed method and existing methods, the proposed method solves the first part of the decoding schedule with constant critical path delay and lower space complexity, and solves the second part of the decoding schedule with less calculations. Besides, experimental results show that the proposed method does not affect the error performance of polar codes.
Recently invented ABS+ polar codes provide substantially faster polarization than classical polar codes. We present the simplified version of SCL decoding for ABS+ polar codes that implements the idea of pruning of the recursion tree in the successive algorithm. The proposed fast simplified SCL (FSSCL) decoder provides better tradeoff between performance and arithmetic complexity than FSSCL decoder of classical polar codes. It also experiences lower latency in comparison with polar codes with large kernels under window processing (WP) based decoding while the performance and complexity are the same.
Neural Network Decoders (NNDs) have been recently considered and investigated as an alternative to the classical algorithms for decoding Polar Codes. In particular, a class of partitioned decoders has been proposed where modified Successive Cancellation (SC) or Belief Propagation (BP) algorithms exploit the neural network decoding of short sublocks. Although NNDs work as one-shot decoders with small decoding latency, the performance of these decoders, in comparison with classic approaches, still suffers from some losses; this fact limits their application to codes with short/medium length. In this article we introduce the novel Neural Successive Cancellation List (NSCL) decoder, as a partitioned version of the SC decoder operating on a list of L multiple decoding candidates that are built with the decoded sub-blocks obtained from a set of NNDs working in parallel at each partition. This decoder significantly improves the BER performance of the non-list version under the same code length. Hence, it reduces the intrinsic loss of performance given by the use of NNDs and allows the application of NN-based decoding to longer codewords.