A new type of transitional filter based on summation of polynomials

A Fractional-Order Transitional Butterworth-Butterworth Filter and Its Experimental Validation

“…Figure 2 (top) illustrates the smaller group delay of the proposed model no. 1 compared to the classical TBBF (n = k = 1) reported in [20]. Group delay comparisons of the proposed approximant for no.…”

“…Group delay comparisons of the proposed approximant for no. 5 with the classical TBBFs [20]. Note that the numbers within the parenthesis represent (n1, n2, α, β).…”

“…cited in [20] for (n = 2, k = 1) and (n = 3, k = 2) are shown in Figure 2 (bottom). Results reveal that the group delay behavior of the optimal model lies in-between the responses of the classical filters.…”

“…Transitional filters may be designed by combining different filter poles using the arithmetic or geometric interpolation, as exemplified by the transitional Legendre-Thomson filter [18], and the transitional ultraspherical-ultraspherical filter [19]. An alternative design technique involves combining the classical filter polynomials [20]. The magnitude squared function of the classical Transitional Butterworth-Butterworth Filter This work is licensed under a Creative Commons Attribution 4.0 License.…”

“…Thus, inequality constraints are avoided to meet the s-domain stability criteria. Table 1 compares the advantages and limitations of the proposed method with those of the FOBF [9], [21], [22], and TBBF [20] design techniques. Several design cases are considered to evaluate the performance of the proposed technique.…”