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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2022-06-01


    Size :

    1522122 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Performance complexity tradeoffs for turbo and turbo-like codes

    Dolinar, S. / Divsalar, D. / Kiely, A. et al. | NTRS | 2001



    Simulation of universal CCSDS Turbo-codes decoder of non-standard parameters

    Qi, Z. / Yujiao, D. | British Library Online Contents | 2014


    A Comparison of Modified Convolutional Codes with Sequential Decoding and Turbo Codes

    Morakis, J. / Miller, W. / IEEE; Aerospace and Electronics Systems Society | British Library Conference Proceedings | 1998