The Chase-Pyndiah algorithm which is a soft-input/soft-output algorithm is revisited for decoding turbo product codes (TPC). In general, soft-output computation of the algorithm involves a huge amount of compare and save operations. In this paper, a hybrid approach is considered for the soft output computation which reduces the amount of these operations to a moderate level comparing to the original algorithm. For the Hamming code TPCs $(32,26,4)^{2}$ and $(64,57,4)^{2}$, the Chase-Pyndiah algorithm with hybrid approach for the soft output computation has shown no degradation in coding gain when compared to the original algorithm while reducing the algorithm’s complexity.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Moderate Complexity Turbo Decoder for Near-Optimum Decoding of Product Codes


    Beteiligte:


    Erscheinungsdatum :

    01.06.2022


    Format / Umfang :

    1522122 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch