Matrix signal flow graphs and an optimum topological method for evaluating their gains
- 1 September 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 19 (5) , 427-435
- https://doi.org/10.1109/tct.1972.1083542
Abstract
Some properties of matrix signal flow graphs are investigated and an optimum topological method for evaluating the graph gains is presented. The method is optimum in the sense that the gain expression has the minimum number of distinct inverses. It is topological in the sense that the gain expression is obtained from the structure of the graph without graph reductions.Keywords
This publication has 10 references indexed in Scilit:
- Analysis of mixed-source active networksProceedings of the IEEE, 1970
- State Variables and Feedback TheoryIEEE Transactions on Circuit Theory, 1969
- State-Variable Analysis of RLC Networks Containing Nonlinear Coupling ElementsIEEE Transactions on Circuit Theory, 1969
- Controllability and observability of feedback systemsIEEE Transactions on Automatic Control, 1967
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966
- On the Theory of Linear Multi-Loop Feedback SystemsBell System Technical Journal, 1963
- Flow graphs, signal flow graphs, and graph determinantsProceedings of the IEE Part C: Monographs, 1962
- About Such Things as Unistors, Flow Graphs, Probability, Partial Factoring, and MatricesIRE Transactions on Circuit Theory, 1957
- Feedback Theory-Further Properties of Signal Flow GraphsProceedings of the IRE, 1956
- Feedback Theory-Some Properties of Signal Flow GraphsProceedings of the IRE, 1953