Iterative Decoding of GSCB Codes Based on RS Codes Using Adapted Scaling Factors

In this work, we have extended two algorithms to decode generalized serially concatenated block codes based on RS codes (GSCB-RS). The first is the modified Chase-Pyndiah algorithm (MCPA) proposed by Farchane and Belkasmi[1]. The second is the Chase-Pyndiah algorithm (CPA) that is developed initially for decoding turbo product codes[2]. We also investigated the effect of different parameters, namely component codes, the size and structure of the interleaver and the number of iterations, using computer simulations. The simulations result shows that the performance of the GSCB-RS codes using the MCPA decoder out performs the CPA decoder that uses predetermined weighting factor (α) and reliability factor (β) parameters. © 2020, Springer Nature Switzerland AG.