Premium
Sensitivity minimization in signal‐flow graphs
Author(s) -
Tan M. Ali,
Acar Cevdet
Publication year - 1982
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.4490100103
Subject(s) - signal flow graph , minification , transfer function , sensitivity (control systems) , mathematics , signal (programming language) , control theory (sociology) , flow (mathematics) , graph , filter (signal processing) , topology (electrical circuits) , mathematical optimization , computer science , combinatorics , geometry , electronic engineering , engineering , control (management) , artificial intelligence , electrical engineering , computer vision , programming language
In this work, the sensitivity minimization is studied for the signal‐flow graph of the state equations realizing a general biquadratic transfer function. The sensitivity measures are defined for the poles, the pole Q and the pole frequency. The formulae are derived for their evaluations. Branch transmittances minimizing each of these measures are found. Finally, it is shown that there exists a very simple relation between the measures. The results obtained in this study can be used in active filter realizations with minimum sensitivity.