Bacteria foraging optimisation algorithm for optimal FIR filter design
by Suman Kumar Saha; Rajib Kar; Durbadal Mandal; Sakti Prasad Ghoshal
International Journal of Bio-Inspired Computation (IJBIC), Vol. 5, No. 1, 2013

Abstract: This paper presents a novel search algorithm, called bacteria foraging optimisation (BFO) for the design of linear phase positive symmetric FIR low pass, high pass, band pass and band stop filters, realising the respective ideal filter specifications. BFO is a population-based evolutionary optimisation concept used to solve nonlinear optimisation problem where each individual maintains the propagation of genes. BFO favours propagation of genes of those animals which have efficient foraging strategies and eliminate those animals that have weak foraging strategies i.e., method of finding, handling and taking in food. All animals with their own physiological and environmental constraints, try to maximise the consumption of energy per unit time interval. The performances of BFO-based FIR filter designs have proven to be superior as compared to those obtained by real coded genetic algorithm (RGA) and standard particle swarm optimisation (PSO) optimisation techniques. The simulation results justify that BFO is the best optimiser among the other optimisation techniques, not only in the convergence speed but also in the accuracy and the optimal performances of the designed filters.

Online publication date: Wed, 03-Apr-2013

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 Bio-Inspired Computation (IJBIC):
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