Non-binary kernels are used to improve the length flexibility of polar codes. Given the long decoding latency of the successive-cancellation (SC) decoder, devising fast decoding solutions for non-binary kernels is necessary. In this work, we identify a new node in the decoding tree of polar codes which are constructed by commonly used ternary kernels. We call this t-dimensional SPC (tD-SPC) node and propose a low-complexity decoder for it. Moreover, we adapt a node introduced for binary kernel to be used in the fast SC decoding of the 3×3 kernel polar codes. Simulation results show that implementing the proposed fast decoders can reduce the decoding latency by more than 40% if a performance loss of just 0.5 dB is tolerated.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    New Fast Nodes for 3×3 Kernel Polar Codes




    Publication date :

    2020-11-01


    Size :

    1051711 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Hybrid Multi-Kernel Construction of Polar Codes

    Cheng, Lei / Zhou, Wei / Zhang, Lijun | IEEE | 2019


    Polar Codes for SCMA Systems

    Vameghestahbanati, Monirosharieh / Marsland, Ian / Gohary, Ramy H. et al. | IEEE | 2017


    Interleaved CRC for Polar Codes

    Hui, Dennis / Breschel, Michael / Blankenship, Yufei | IEEE | 2018


    Throughput-Based Design of Polar Codes

    Khoshnevis, Hossein / Marsland, Ian / Yanikomeroglu, Halim | IEEE | 2017


    Design of Length-Compatible Polar Codes: A Compound Polar Code's Perspective

    Chang, Wen-Che / Chang, Tofar C.-Y. / Su, Yu T. | IEEE | 2019