DocumentCode
1404214
Title
A proof of the topological rules of signal-flow-graph analysis
Author
Nathan, A.
Volume
109
Issue
15
fYear
1962
fDate
3/1/1962 12:00:00 AM
Firstpage
83
Lastpage
85
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);
fLanguage
English
Journal_Title
Proceedings of the IEE - Part C: Monographs
Publisher
iet
ISSN
0369-8904
Type
jour
DOI
10.1049/pi-c.1962.0011
Filename
5245307
Link To Document