2024/08/26 by Ali Farsiabi, Hamid Ebrahimzad, Masoud Ardakani +1 · 1 citation
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Error Correcting Code Techniques #Wireless Communication Networks Research
paper · doi:10.1109/tcomm.2024.3447781
openalex publication_date 2024/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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× 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.