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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Adaptive Group Based Symbol Flipping Decoding Algorithm


    Beteiligte:


    Erscheinungsdatum :

    2023-06-01


    Format / Umfang :

    3094852 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Flipping device and flipping method thereof

    ZHANG JIAN / LI CHAO | Europäisches Patentamt | 2020

    Freier Zugriff


    FLIPPING CONVERSION SEAT AND LEAN POST

    FOSS CHARLES DEAN / DAILY DANIEL PATRICK | Europäisches Patentamt | 2018

    Freier Zugriff

    Flipping conversion seat and lean post

    FOSS CHARLES DEAN / DAILY DANIEL PATRICK | Europäisches Patentamt | 2017

    Freier Zugriff