Abstract

Cuckoo search algorithm (CSA) is relatively a new optimization technique with less control parameters and strong exploration ability. Due to the random search associated with CSA, it requires large number of functional evaluations for obtaining optimal solution. An improved algorithm, named as improved global-best-guided CSA, is presented here based on the best solution of previous iteration for the optimal design of multiplierless two-dimensional recursive digital filters. The most important feature of the proposed algorithm is that it is completely self-adaptive with no tuning parameters, whereas in CSA the replacement factor needs to be adjusted. The proposed algorithm exhibits 52% improvement in fitness function evaluation (for p = 2) and the execution time is reduced by 56% in comparison with the existing algorithms. Further, the proposed algorithm has been tested for several benchmark problems and found to exhibit significant performance improvement.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call