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-Pyn
- PDF / 942,282 Bytes
- 12 Pages / 439.37 x 666.142 pts Page_size
- 66 Downloads / 199 Views
Polydisciplinary Faculty, Sultan Moulay Slimane University, Beni Mellal, Morocco [email protected], [email protected], [email protected] 2 ENSIAS, Mohammed V University in Rabat, Rabat, Morocco [email protected]
Abstract. In this work, we have extended two algorithms to decode generalized serially concatenated block codes based on RS codes (GSCBRS). 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. Keywords: RS codes · Chase decoding · Generalized serial concatenated block · Modified Chase algorithm · Turbo decoding
1
Introduction
In 1993, Berrou et al. [3] constructed turbo codes. It consists of concatenation of two recursive convolutional codes separated by a non-uniform interleaver. These codes showed exceptional performances. One year later, Pyndiah et al. [4] proposed a new iterative decoding algorithm based on a SISO decoder version of the Chase decoding. It gives a new directions to researchers in the field. In their work, they used predetermined parameters weighting factor (α) and reliability factor (β). The achieved results are similar to those of convolution turbo codes. But Chase-pyndiah did not decode the concatenated codes (serially, parallel). The authors [5,6] extended the work of Chase-Pyndiah to decode generalized concatenated blocks codes using always predetermined parameters α and β. Moreover, the same authors modified the CPA decoder using adapted parameters α and β to the context of the decoder. In their work [1] they evaluated the performance of the MCPA decoder for the product and concatenated codes based on BCH codes. Our contribution in this paper are extension of the MCPA and c Springer Nature Switzerland AG 2020 M. Belkasmi et al. (Eds.): ACOSIS 2019, CCIS 1264, pp. 103–114, 2020. https://doi.org/10.1007/978-3-030-61143-9_9
104
E. Azougaghe et al.
CPA decoders to decode generalized concatenated block codes based on RS codes, validation of the effectiveness of the MCPA and CPA decoders, and also investigation of same parameters, namely the component codes, the number of iterations, interleaver size and pattern. This paper is organized as follow: Sect. 2 gives an overview of the encoder structure of the generalized serially concatenated block codes with its classic and new constructions. Section 3 sheds light on the component decoder. In Sect. 4, We present the iterative decoding of the GSCB-RS codes. The simulation results are presented and discussed in Sect. 5. The last section concludes this paper and gives suggestions for furth
Data Loading...
