Dual soft decoding of linear block codes using memetic algorithm

Abstract

In this article we will approach the soft-decision decoding for the linear block codes, is a kind of decoding algorithms used to decode data to form better original estimated received message, it is considered as a NP-hard problem. In this article we present a new decoder using memetic algorithm such metaheuristic technic operates on the dual code rather than the code itself that aims to find the error caused when sending a codeword calculated from a message of k bits of information, the resulting codeword contains n bits, including the redundancy bits, the efficiency of an error-correcting code is equivalent to the ratio k/n, the rate is belong the interval [0,1]. Hence a good code is the one that ensures a certain error correcting capability at minimum ratio. The results proved that this approach using a combination of genetic algorithm and local search algorithm provides a sufficiently good solution to an optimization problem; the new decoder is applied on linear codes where the structure is given by a parity check matrix.