z-logo
open-access-imgOpen Access
Design of p ‐norm linear phase FIR differentiators using adaptive modification rate artificial bee colony algorithm
Author(s) -
Kwan Hon Keung,
Raju Rija
Publication year - 2020
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
eISSN - 1751-9683
pISSN - 1751-9675
DOI - 10.1049/iet-spr.2019.0587
Subject(s) - differentiator , finite impulse response , algorithm , linear phase , norm (philosophy) , adaptive filter , computer science , mathematics , mathematical optimization , filter (signal processing) , political science , law , computer vision
In this paper, an adaptive modification rate artificial bee colony (AMR‐ABC) algorithm is proposed by incorporating a novel adaptive modification rate to adaptively balance exploration and exploitation to determine which parameters (or the number of parameters) to be updated in a solution during each iteration. The performance of the AMR‐ABC algorithm is compared to those the standard ABC algorithm and its two variants, and the Parks–McClellan algorithm for designing Type 3 (orders: 14, 26, and 38) and Type 4 (orders: 13, 25, and 37) linear phase FIR differentiators to evaluate their design capabilities. Design results have shown that the proposed AMR‐ABC algorithm (i) outperforms four other design algorithms with the lowest p ‐norm error in each of the six differentiator designs and (ii) is robust such that the same p ‐norm error solution with an equiripple amplitude response in each of the six differentiator designs can be obtained by repeating a design with a different population of randomly generated initial solutions. The filter coefficients of six linear phase FIR differentiator designs are given as benchmarks to compare the p ‐norm error performance of the AMR‐ABC algorithm to other algorithms. The AMR‐ABC algorithm is attractive to be used for optimisation in this and other design problems.

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