By Topic

Design of optimal digital IIR filters by using a Bandwidth Adaptive Harmony Search algorithm

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
$33 $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

5 Author(s)
Sayan Ghosh ; Dept. of Electronics and Telecommunication Engg, Jadavpur University, Kolkata, India ; Debarati Kundu ; Kaushik Suresh ; Swagatam Das
more authors

Evolutionary optimization algorithms have been recently applied to optimal digital IIR filter design. In this paper, we apply a bandwidth adaptive harmony search (BAHS) algorithm to the design of 1-dimensional IIR filters. Harmony search is an evolutionary algorithm, which emulates the improvisation process of musicians. We have modified the algorithm by setting the bandwidth equal to the standard deviation of the vectors in the harmony memory, and by introducing a penalty function to ensure IIR filter stability. The proposed variant has been applied to the design of low-pass, high-pass, band pass and band stop filters, by minimizing the L1 and L2 norm approximation errors and the maximum pass band and stop band ripples. The algorithm has been compared with the TIA approach. The harmony search variant has been found to outperform the TIA approach in designing IIR filters having near-desired frequency responses.

Published in:

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Date of Conference:

9-11 Dec. 2009