SWITCHING NETWORKS BY LINEAR GRAPH THEORY
Abstract
An analytic tool in the realization of circuit matrices is presented. The method is based on forming linear trees with each row of a fundamental circuit matrix and combining them to form a tree of the graph. With this method, more difficult problems in the synthesis of contact networks by linear graph theory can be considered. A method of simultaneous synthesis is developed in which two or more switching functions are realized by sharing contacts in an optimal form. Finally the multi-terminal procedures are extended to the synthesis of non-bilateral, 1 port switching networks.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1963
- Accession Number
- AD0406896
Entities
People
- P. Lavallee
Organizations
- New York University Tandon School of Engineering