Improved Decoding of Linear Block Codes by Concatenated Decoders
Moulay Seddiq El Kasmi Alaoui1, Issam Abderrahman Joundan2, Said Nouh3, Abdelaziz Marzak4

1Moulay Seddiq El Kasmi Alaoui*, TIM Lab, Faculty of Sciences Ben M’sik, Hassan II University, Casablanca, Morocco.
2Issam Abderrahman Joundan, TIM Lab, Faculty of Sciences Ben M’sik, Hassan II University, Casablanca, Morocco.
3Said Nouh, TIM Lab, Faculty of Sciences Ben M’sik, Hassan II University, Casablanca, Morocco.
4Abdelaziz Marzak, TIM Lab, Faculty of Sciences Ben M’sik, Hassan II University, Casablanca, Morocco.
Manuscript received on January 02, 2020. | Revised Manuscript received on January 15, 2020. | Manuscript published on January 30, 2020. | PP: 363-371 | Volume-8 Issue-5, January 2020. | Retrieval Number: E5840018520/2020©BEIESP | DOI: 10.35940/ijrte.E5840.018520

Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The use of decoding algorithms allows us to retrieve information after transmitting it over a noisy communication channel. Soft decision decoding is powerful in concatenation schemes that use two or more levels of decoding. In our case, we make a concatenation between the Hartmann & Rudolph (HR) algorithm as symbol-by-symbol decoder and the chase-2 algorithm that is word-to-word decoding algorithm. In this paper, we propose to combine two decoding algorithms for constructing a new one with more efficiency and less complexity. This work consists firstly to use the HR with a reduced number of codewords of the dual code then the Chase-2 algorithm which exploits the output of PHR. The simulations results and the comparisons made show that the proposed decoding scheme guarantees very good performance with reduced temporal complexity.
Keywords: Error Correcting Codes, Hartmann & Rudolph, Chase-2 Algorithm, Phr Chase.
Scope of the Article: Parallel and Distributed Algorithms.