Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Evolutionary design of 2-dimensional recursive filters via the computer language GENETICA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gonos, I.F. ; Sch. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece ; Virirakis, L.I. ; Mastorakis, N.E. ; Swamy, M.N.S.

In this paper, we present a new design method for a class of two-dimensional (2-D) recursive digital filters using an evolutionary computational system. The design of the 2-D filter is reduced to a constrained minimization problem the solution of which is achieved by the convergence of an appropriate evolutionary algorithm. In our approach, the genotypes of potential solutions have a uniform probability within the region of the search space specified by the constraints and zero probability outside this region. This approach is particularly effective as the evolutionary search considers only those potential solutions that respect the constraints. We use the computer language GENETICA, which provides the expressive power necessary to get an accurate problem formulation and supports an adjustable evolutionary computational system. Results of this procedure are illustrated by a numerical example, and compared with those of some previous designs.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:53 ,  Issue: 4 )