Matrix signal flow graphs and an optimum topological method for evaluating their gains

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.