| Abstract: | This paper deals with the optimal analog‐to‐digital transformation of fractional‐order Butterworth filter (FOBF) in terms of infinite impulse response templates. The fractional‐order transfer function of the analog FOBF is transformed into its digital counterpart by employing the Binomial series expansion of different truncation orders, based on the Al‐Alaoui operator. This nonoptimal solution is then treated as an initial point for a local search optimizer such as the Nelder–Mead simplex (NMS) algorithm and also injected as a super‐fit individual in the initial population of a global search constrained evolutionary optimization algorithm (CEOA). Design stability and minimum‐phase response constraints are formulated for the super‐fit scheme. Both the techniques demonstrate good modeling performance; however, the super‐fit CEOA can markedly outperform the NMS method as the problem dimensionality increases. |
