Abstract
AbstractThis paper presents an efficient approach to design stable, wideband, and infinite impulse response digital integrators (DIs) and digital differentiators (DDs) of first, second, third, and fourth order using an evolutionary optimization algorithm called harmony search (HS). In recent years, although wideband DIs and DDs have been designed using metaheuristic optimization techniques such as simulated annealing, genetic algorithm, and particle swarm optimization (PSO), these algorithms lead to sub‐optimal solutions because of stagnation and premature convergence. HS algorithm, however, promises an enhanced frequency response for DIs and DDs because of the better exploration and exploitation of the search space. Simulation results demonstrate the superiority of HS‐based designs as compared with three well‐known benchmark evolutionary optimization algorithms, namely real coded genetic algorithm (RGA), PSO, and differential evolution (DE) based designs by yielding the least values of different magnitude response error metrics. Parametric and non‐parametric statistical hypothesis tests are also conducted to compare the consistency in the performance of HS‐based DIs and DDs with those of the designs based on RGA, PSO, and DE. The proposed HS‐based designs also outperform those of the designs based on both classical and evolutionary optimization approaches reported in recent literature in terms of the maximum absolute magnitude error metric.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
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.