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

arXiv:2012.08139

Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

Peter Trifonov

Published Dec 15, 2020• 0 citations
arXivHTMLPDF

Abstract

Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes. Performance comparison with Arikan PAC and LDPC codes is provided. Furthermore, complete description of the decoding algorithm is presented.

DOI
10.48550/arxiv.2012.08139

Related papers

Sequential decoding of polar codes with arbitrary binary kernel

Vera Miloslavskaya, Peter Trifonov

The problem of efficient soft-decision decoding of polar codes with any binary kernel is considered. The proposed approach represents a generalization of the sequential decoding algorithm introduced recently for the case of polar codes with Arikan kernel. Numeric results show that the proposed algorithm enables near-ML decoding of polar codes with BCH kernel.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•23 citations

Generalized Concatenated Polarization Kernels

Peter Trifonov

A novel class of polarization kernels is proposed, which is based on the construction of generalized concatenated codes. The complexity of the kernel processing operation, which is the computational core of the (list) successive cancellation decoder, for the obtained kernels of size 64 is several orders of magnitude less compared to BCH and Yao-Fazeli-Vardy kernels. Polar subcodes based on the obtained kernels under list successive cancellation decoder provide both performance and complexity improvement with respect to those based on the Arikan kernel.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•1 citation

Chained successive cancellation decoding of the extended Golay code

Peter Trifonov

The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its sequential generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.

arXiv:1801.06315•Iran Workshop on Communication and Information Theory (IWCIT)•Apr 1, 2018•0 citations

Fast Successive Cancellation Decoding of Polar Codes With Large Kernels

Anatolii Ashikhmin, Peter Trifonov

A generalization of the fast successive cancellation decoding algorithm to the case of binary polar codes with arbitrary large kernels is presented. Its asymptotic latency is shown to be$O(N^{1-1/\mu })$, where$\mu $is the scaling exponent of the underlying polarization kernel.

IEEE Transactions on Communications•Jun 28, 2024•6 citations

Sequential Decoding of Polar Codes

Vera Miloslavskaya, Peter Trifonov

The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.

•Jul 1, 2014•0 citations

Sequential Decoding of Polar Codes

V. Miloslavkaya, Peter Trifonov

The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.

IEEE Communications Letters•May 13, 2014•81 citations
Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes. Performance comparison with Arikan PAC and LDPC codes is provided. Furthermore, complete description of the decoding algorithm is presented.
A novel class of polarization kernels is proposed, which is based on the construction of generalized concatenated codes. The complexity of the kernel processing operation, which is the computational core of the (list) successive cancellation decoder, for the obtained kernels of size 64 is several orders of magnitude less compared to BCH and Yao-Fazeli-Vardy kernels. Polar subcodes based on the obtained kernels under list successive cancellation decoder provide both performance and complexity improvement with respect to those based on the Arikan kernel.
A generalization of the fast successive cancellation decoding algorithm to the case of binary polar codes with arbitrary large kernels is presented. Its asymptotic latency is shown to beO(N1−1/μ)O(N^{1-1/\mu })O(N1−1/μ), where$\mu $is the scaling exponent of the underlying polarization kernel.