z-logo
open-access-imgOpen Access
Design of Finite Impulse Response Filters Based on Genetic Algorithm
Author(s) -
Raaed F. Hassan,
Ali Subhi Abbood
Publication year - 2013
Publication title -
mağallaẗ diyālá li-l-ʿulūm al-handasiyyaẗ/mağallaẗ diyālá li-l-ʻulūm al-handasiyyaẗ
Language(s) - English
Resource type - Journals
eISSN - 2616-6909
pISSN - 1999-8716
DOI - 10.24237/djes.2013.06303
Subject(s) - finite impulse response , crossover , infinite impulse response , genetic algorithm , computer science , algorithm , filter design , genetic programming , population , filter (signal processing) , mathematical optimization , digital filter , mathematics , artificial intelligence , machine learning , demography , sociology , computer vision
Genetic Algorithms (GAs) are used to solve many optimization problems in science and engineering such as pattern recognition, robotics, biology, medicine, and many other applications. The aim of this paper is to describe a method of designing Finite Impulse Response (FIR) filter using Genetic Algorithm (GA). In this paper, the Genetic Algorithm not only used for searching the optimal coefficients, but also it is used to find the minimum number of Taps, and hence minimize the number of multipliers and adders that can be used in the design of the FIR filter. The Evolutionary Programming is the best search procedure and most powerful than Linear Programming in providing the optimal solution that is desired to minimize the ripple content in both passband and stopband. The algorithm generates a population of genomes that represents the filter coefficient and the number of taps, where new genomes are generated by crossover and mutation operations methods. Our proposed genetic technique has able to give better result compare to other method.The FIR filter design using Genetic Algorithm is simulated using MATLAB programming language version 7.6.0.324 (R2008a).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here