Abstract

Abstract This paper proposes a new algorithm based on Gbest-guided Cuckoo Search (GCS) algorithm for the design of higher order Quadrature Mirror Filter (QMF) bank. Although the optimization of lower order filters can be performed easily by applying existing meta-heuristic optimization techniques like Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC) etc., these methods are unsuccessful in searching higher order filter coefficients due to multimodality and nonlinear problem space; leads to some undesirable behaviors in filter responses like ripples in transition band, lower stop-band attenuation etc.. Comparison with other available results in the literature indicate that the proposed method exhibits an 69.02% increase in stop-band attenuation and 99.71% reduction in Perfect Reconstruction Error (PRE) of higher order filter bank. Besides, the percentage improvements in Fitness Function Evaluations (FFEs) of GCS based 55th order QMF bank design with respect to PSO, ABC and CSA are 81%, 82% and 59% respectively, and execution time is improved by 73%, 72% and 42% respectively. The simulation results also reveal that the proposed approach exhibits lowest mean and variance in different assessment parameters of filter bank and it does not require tuning of algorithmic parameters whereas in standard CSA replacement factor need to be adjusted. Further, the proposed algorithm is tested on six standard benchmark problems and complex benchmark functions from the CEC 2013 where it demonstrated significant performance improvements than other existing methods.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.