z-logo
open-access-imgOpen Access
Optimal design of wideband infinite impulse response fractional order digital integrators using colliding bodies optimisation algorithm
Author(s) -
Mahata Shibendu,
Saha Suman Kumar,
Kar Rajib,
Mandal Durbadal
Publication year - 2016
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2016.0298
Subject(s) - integrator , robustness (evolution) , particle swarm optimization , differential evolution , algorithm , computer science , benchmark (surveying) , metaheuristic , impulse (physics) , mathematical optimization , mathematics , bandwidth (computing) , computer network , biochemistry , chemistry , geodesy , gene , geography , physics , quantum mechanics
This study presents a novel approach to design wideband infinite impulse response fractional order digital integrators (FODIs) for the half and one‐fourth order integrators based on a parameter independent metaheuristic algorithm called colliding bodies optimisation (CBO). The performance of CBO‐based FODIs have been compared with the designs based on three well‐known benchmark evolutionary optimisation algorithms namely, real coded genetic algorithm (RGA), particle swarm optimisation (PSO), and differential evolution (DE) in terms of robustness, consistency, parameter sensitivity, convergence speed, and computational time. Simulations results confirm that the proposed CBO‐based designed FODIs achieve consistently superior magnitude responses in a computationally efficient manner as compared with the designs based on RGA, PSO, and DE. The proposed CBO‐based FODIs also significantly outperform all state‐of‐the‐art designs reported in literature in terms of two different magnitude response error metrics. This research work underlines the potential of CBO as an efficient optimisation tool for the design of accurate digital approximations to the fractional order integrators.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here