This paper introduces an adaptive technique for grouping variable nodes in decoding non-binary LDPC codes that involve symbol flipping. The technique considers both the individual symbol reliability and majority-based voting when grouping variable nodes in each iteration. Groups are formed based on the cumulative density of the variable nodes, with the least reliable variable nodes given the highest priority. The decoding algorithm then proceeds to decode subsequent groups in order of decreasing priority. The results of numerical analysis demonstrate that this approach strikes a balance between computational complexity and bit error rate performance, making it suitable for various applications, such as data storage and mobile networks.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Adaptive Group Based Symbol Flipping Decoding Algorithm


    Contributors:


    Publication date :

    2023-06-01


    Size :

    3094852 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Flipping device and flipping method thereof

    ZHANG JIAN / LI CHAO | European Patent Office | 2020

    Free access


    FLIPPING CONVERSION SEAT AND LEAN POST

    FOSS CHARLES DEAN / DAILY DANIEL PATRICK | European Patent Office | 2018

    Free access

    Flipping conversion seat and lean post

    FOSS CHARLES DEAN / DAILY DANIEL PATRICK | European Patent Office | 2017

    Free access