• DocumentCode
    1171000
  • Title

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

  • Author

    Riegle, Daryle E. ; Lin, P.M.

  • Volume
    19
  • Issue
    5
  • fYear
    1972
  • fDate
    9/1/1972 12:00:00 AM
  • Firstpage
    427
  • Lastpage
    435
  • 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
    Matrix methods; Network topology; Signal flow graphs; Circuit synthesis; Circuit theory; Equations; Flow graphs; Inspection; Minimax techniques; Physics;
  • fLanguage
    English
  • Journal_Title
    Circuit Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9324
  • Type

    jour

  • DOI
    10.1109/TCT.1972.1083542
  • Filename
    1083542