Premium
An optimum approximation for the interchange of a second‐order transfer function by a transfer function with decreased pole Q ‐factor
Author(s) -
Filanovsky I. M.,
Stromsmoe K. A.
Publication year - 1979
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490070306
Subject(s) - transfer function , closed loop pole , function (biology) , order (exchange) , mathematics , transfer (computing) , pole–zero plot , factor (programming language) , closed loop transfer function , mathematical analysis , control theory (sociology) , topology (electrical circuits) , computer science , combinatorics , engineering , control (management) , finance , artificial intelligence , evolutionary biology , parallel computing , electrical engineering , economics , full state feedback , biology , programming language
This article presents a method for the interchange of a second‐order circuit with high Q ‐factor poles by a more complicated network that consists of several low Q ‐factor stages. The ratio of the substituting circuit transfer function to the given second‐order transfer function approximates unity with a minimum deviation over the whole jw ‐axis. The method is applicable to all types of second‐order transfer functions with arbitrary zero locations. The approximation error decreases in a geometric progression with the number of low Q ‐factor stages. A method for determining the poles and zeros of the approximating transfer function is described and examples of interchanging are given.