Sensitivity minimization in signal‐flow graphs

Abstract

AbstractIn 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.