Design of multiplier-less continuously variable bandwidth sharp FIR filters using modified harmony search algorithm
by James T. George; Elizabeth Elias
International Journal of Information Technology and Management (IJITM), Vol. 14, No. 1, 2015

Abstract: Variable bandwidth filters (VBFs) which are widely used in applications such as SDR channelisers, require online tuning of the frequency characteristics, re-configurability and low complexity. Conventional methods require some mathematical computation to obtain the new filter coefficients for each desired bandwidth. Harris (2009) has proposed a new design method for a variable bandwidth filter without change in the filter coefficient values. But this can be used only for bandwidth reduction. George and Elias (2012) have proposed a design method for bandwidth reduction as well as enhancement. This paper proposes an optimal and totally multiplier-less implementation of a VBF. A frequency response masking filter with continuous coefficients is designed and synthesised in the canonic signed digit (CSD) format. Metaheuristic optimisation algorithms such as differential evolution and harmony search are deployed to determine the optimised filter coefficient values and the system performances in the bandwidth reduction and enhancement cases are evaluated.

Online publication date: Sat, 09-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology and Management (IJITM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com