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 Symposium on Turbo Codes and Iterative Information Processing

Efficient Decoding Algorithms for Polar Codes based on 2×2 Non-Binary Kernels.

Peihong Yuan, Fabian Steiner

Published Jan 1, 2018• 0 citations
OpenAlex

Related papers

Multi-stack Decoding of Polar Codes

Dongsheng Wu, Qingshuang Zhang, Yingxian Zhang

Lecture notes in electrical engineering•Jan 1, 2016•0 citations

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•22 citations

Generalized Simplified Successive-Cancellation Decoding of Multi-kernel Polar Codes

Yanlong Zhao, Zhilu Wu, Zhendong Yin +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2022•2 citations

Construction and Decoding Algorithms for for Polar Codes based on $2\times2$ Non-Binary Kernels

Peihong Yuan, Fabian Steiner

Polar codes based on $2\times2$ non-binary kernels are discussed in this work. The kernel over $\text{GF}(q)$ is selected by maximizing the polarization effect and using Monte-Carlo simulation. Belief propagation (BP) and successive cancellation (SC) based decoding algorithms are extended to non-binary codes. Additionally, a successive cancellation list (SCL) decoding with a pruned tree is proposed. Simulation results show that the proposed decoder performs very close to a conventional SCL decoder with significantly lower complexity.

arXiv:1807.03767•Jul 10, 2018•2 citations

A Study on Relationship between Kernel Order and Decoding Performance of Multi-Kernel Polar codes

智大 樋口, 湧介 大木, 凌 柴田 +1 more

IEICE Technical Report; IEICE Tech. Rep.•Nov 24, 2020•0 citations

Fast Successive-Cancellation Decoding of 2 × 2 Kernel Non-Binary Polar Codes

Ali Farsiabi, Hamid Ebrahimzad, Masoud Ardakani +1 more

Non-binary polar codes (NBPCs) decoded by successive cancellation (SC) algorithm have remarkable bit-error-rate performance compared to the binary polar codes (BPCs). Due to its serial nature, SC decoding suffers from long latency. The latency issue in BPCs has been the topic of extensive research and it has been notably resolved by the introduction of fast SC-based decoders. However, the latency problem of NBPCs is mainly untouched and the vast majority of research on NBPCs is devoted to issues concerning design and efficient implementation. In this paper, we propose fast SC decoding for NBPCs constructed based on$2\times 2$kernels. In particular, we extend the special nodes of BPCs to their non-binary counterpart and define various non-binary special nodes in the SC decoding tree of NBPCs and propose their fast decoding. This way, we avoid traversing the full decoding tree and significantly reduce the decoding delay compared to symbol-by-symbol SC decoding. We also propose a simplified NBPC structure that facilitates the procedure of non-binary fast SC decoding. Using our proposed fast non-binary decoder, we observe an improvement of more than 96% in latency concerning the original SC decoding. This is while our proposed fast SC decoder for NBPCs incurs no error-rate loss.

arXiv:2401.07433•IEEE Transactions on Communications•Aug 26, 2024•6 citations
Construction and Decoding Algorithms for for Polar Codes based on 2×22\times22×2 Non-Binary Kernels
Polar codes based on 2×22\times22×2 non-binary kernels are discussed in this work. The kernel over GF(q)\text{GF}(q)GF(q) is selected by maximizing the polarization effect and using Monte-Carlo simulation. Belief propagation (BP) and successive cancellation (SC) based decoding algorithms are extended to non-binary codes. Additionally, a successive cancellation list (SCL) decoding with a pruned tree is proposed. Simulation results show that the proposed decoder performs very close to a conventional SCL decoder with significantly lower complexity.
Non-binary polar codes (NBPCs) decoded by successive cancellation (SC) algorithm have remarkable bit-error-rate performance compared to the binary polar codes (BPCs). Due to its serial nature, SC decoding suffers from long latency. The latency issue in BPCs has been the topic of extensive research and it has been notably resolved by the introduction of fast SC-based decoders. However, the latency problem of NBPCs is mainly untouched and the vast majority of research on NBPCs is devoted to issues concerning design and efficient implementation. In this paper, we propose fast SC decoding for NBPCs constructed based on2×22\times 22×2kernels. In particular, we extend the special nodes of BPCs to their non-binary counterpart and define various non-binary special nodes in the SC decoding tree of NBPCs and propose their fast decoding. This way, we avoid traversing the full decoding tree and significantly reduce the decoding delay compared to symbol-by-symbol SC decoding. We also propose a simplified NBPC structure that facilitates the procedure of non-binary fast SC decoding. Using our proposed fast non-binary decoder, we observe an improvement of more than 96% in latency concerning the original SC decoding. This is while our proposed fast SC decoder for NBPCs incurs no error-rate loss.