English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Non-binary polar codes (NBPCs) decoded by successive cancellation (SC)algorithm have remarkable bit-error-rate performance compared to the binarypolar codes (BPCs). Due to the serial nature, SC decoding suffers from largelatency. The latency issue in BPCs has been the topic of extensive research andit has been notably resolved by the introduction of fast SC-based decoders.However, the vast majority of research on NBPCs is devoted to issues concerningdesign and efficient implementation. In this paper, we propose fast SC decodingfor NBPCs constructed based on 2 x 2 kernels. In particular, we identifyvarious non-binary special nodes in the SC decoding tree of NBPCs and proposetheir fast decoding. This way, we avoid traversing the full decoding tree andsignificantly reduce the decoding delay compared to symbol-by-symbol SCdecoding. We also propose a simplified NBPC structure that facilitates theprocedure of non-binary fast SC decoding. Using our proposed fast non-binarydecoder, we observed an improvement of up to 95% in latency concerning theoriginal SC decoding. This is while our proposed fast SC decoder for NBPCsincurs no error-rate loss.

Fast Successive-Cancellation Decoding of 2 x 2 Kernel Non-Binary Polar Codes: Identification, Decoding and Simplification