Title :
A proof of the topological rules of signal-flow-graph analysis
fDate :
3/1/1962 12:00:00 AM
Abstract :
The topological rules for the calculation of a signal-flow-graph transmittance are usually proved by quite a lengthy ad hoc argument. This is neither necessary nor advantageous because a straightforward matrix analysis of the problem leads directly to the desired result. Such an analysis is given in the paper.
Keywords :
automatic control; networks (circuits);
Journal_Title :
Proceedings of the IEE - Part C: Monographs
DOI :
10.1049/pi-c.1962.0011
