• DocumentCode
    1160473
  • Title

    Topological Rules for Linear Networks

  • Author

    Nathan, Arokia

  • Volume
    12
  • Issue
    3
  • fYear
    1965
  • fDate
    9/1/1965 12:00:00 AM
  • Firstpage
    344
  • Lastpage
    358
  • Abstract
    Topological rules are provided for the expansion of admittance functions of linear networks which may include reciprocal and nonreciprocal branches, infinite-gain operational amplifiers, dependent current or voltage sources, vacuum tubes, transistors, and ideal transformers. Kirchhoff\´s rules for reciprocal networks, on the one hand, and signal-flow graph rules, on the other, appear as special cases. The rules are purely topological and, in contradistinction to some prior work, do not include sign rules dependent upon an arbitrary assignment of labels to nodes, or directions to reciprocal branches. Any term in an expansion corresponds to a subgraph of the network. The subgraphs are "loop-woods," formed by trees comprised of reciprocal branches and disjoint loops which include at least one nonreciprocal branch each. Transformers are represented by a set of weighted short circuits. The rules are proved by means of "polar" incidence matrices A+, A- whose properties are explored.
  • Keywords
    Admittance; Bibliographies; Circuit synthesis; Circuit theory; Electron tubes; Impedance; Matrices; Network synthesis; Operational amplifiers; Transformers;
  • fLanguage
    English
  • Journal_Title
    Circuit Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9324
  • Type

    jour

  • DOI
    10.1109/TCT.1965.1082446
  • Filename
    1082446