A reduced complexity decoder using compact genetic algorithm for linear block codes

TitreA reduced complexity decoder using compact genetic algorithm for linear block codes
Publication TypeConference Paper
Year of Publication2017
AuthorsBerkani, A, Belkasmi, M
Conference Name2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings

The compact Genetic Algorithm decoder has been introduced in [9] as an efficient decoding method of linear block codes. It requires less storage memory than Genetic Algorithms based decoders. One of its major weakness is the big number of necessary iterations to reach convergence in comparison with Genetic Algorithms (GA) based decoders. We propose, in this work, new ideas allowing us to reduce the number of iterations from about 105 to just about 103 which reduces the complexity of decoding. This, without decreasing the decoding performance. We introduce a new stopping criterion based on the soft weight of the probability vector p, a new initialization method of p and we tried to combine both methods all together. Both performance study and the calculation of the average number of iterations ensure the effectiveness of the proposed decoder. © 2016 IEEE.




Suivez-nous sur




Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

 Télécopie : (+212) 5 37 77 72 30

  Secrétariat de direction : 06 61 48 10 97

        Secrétariat général : 06 61 70 77 02

        Service des affaires estudiantines : 06 62 44 87 47

        Résidences : 06 61 82 89 77


    Compteur de visiteurs:400,909
    Education - This is a contributing Drupal Theme
    Design by WeebPal.