𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sensitivity minimization in signal-flow graphs

✍ Scribed by M. Ali Tan; Cevdet Acar

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
286 KB
Volume
10
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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.

πŸ“œ SIMILAR VOLUMES

Learning in dynamic neural networks usin
Learning in dynamic neural networks using signal flow graphs
✍ Osowski, Stanislaw; Cichocki, Andrzej πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 239 KB πŸ‘ 1 views

The paper presents the universal approach to the determination of the sensitivity functions for dynamic neural networks and its application in learning algorithms of adaptive networks. The method is based on the application of signal flow graph and specially defined graph adjoint to it. The method i

Drag minimization in stokes flow
Drag minimization in stokes flow
✍ H. Taşeli; M. Demiralp; K. Kafali πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 527 KB