Optimal Approximation of Fractional-Order Butterworth Filter Based on Weighted Sum of Classical Butterworth Filters

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F21%3APU141218" target="_blank" >RIV/00216305:26220/21:PU141218 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9445054" target="_blank" >https://ieeexplore.ieee.org/document/9445054</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACCESS.2021.3085515" target="_blank" >10.1109/ACCESS.2021.3085515</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal Approximation of Fractional-Order Butterworth Filter Based on Weighted Sum of Classical Butterworth Filters

Popis výsledku v původním jazyce

In this paper, a new two-steps design strategy is introduced for the optimal rational approximation of the fractional-order Butterworth filter. At first, the weighting factors of the summation between the nth -order and the (n+1)th -order Butterworth filters are optimally determined. Subsequently, this model is employed as an initial point for another optimization routine, which minimizes the magnitude-frequency error relative to the (n+α)th -order, where α∈(0,1) , Butterworth filter. The proposed approximant demonstrates improved performance about the magnitude mean squared error compared to the state-of-the-art design for six decades of bandwidth, but the introduced approach does not require a fractional-order transfer function model and the approximant of the sα operator. The proposed strategy also avoids the use of the cascading technique to yield higher-order fractional-order Butterworth filter models. The performance of the proposed 1.5th-order Butterworth filter in follow-the-leader feedback topology is verified through SPICE simulations and its hardware implementation based on Analog Devices AD844AN-type current feedback operational amplifier.

Název v anglickém jazyce

Optimal Approximation of Fractional-Order Butterworth Filter Based on Weighted Sum of Classical Butterworth Filters

Popis výsledku anglicky

In this paper, a new two-steps design strategy is introduced for the optimal rational approximation of the fractional-order Butterworth filter. At first, the weighting factors of the summation between the nth -order and the (n+1)th -order Butterworth filters are optimally determined. Subsequently, this model is employed as an initial point for another optimization routine, which minimizes the magnitude-frequency error relative to the (n+α)th -order, where α∈(0,1) , Butterworth filter. The proposed approximant demonstrates improved performance about the magnitude mean squared error compared to the state-of-the-art design for six decades of bandwidth, but the introduced approach does not require a fractional-order transfer function model and the approximant of the sα operator. The proposed strategy also avoids the use of the cascading technique to yield higher-order fractional-order Butterworth filter models. The performance of the proposed 1.5th-order Butterworth filter in follow-the-leader feedback topology is verified through SPICE simulations and its hardware implementation based on Analog Devices AD844AN-type current feedback operational amplifier.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

<a href="/cs/project/GA19-24585S" target="_blank" >GA19-24585S: Syntéza elektrických fantomů věrně popisující fraktální impedanční chování reálných systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Access

ISSN

2169-3536

e-ISSN

—

Svazek periodika

9

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

81097-81114

Kód UT WoS článku

000673940900001

EID výsledku v databázi Scopus

2-s2.0-85107367404