Order of complexity of linear active networks and a common tree in the 2-graph method

2 November 1972

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 8 (22) , 542-543
https://doi.org/10.1049/el:19720395

Abstract

An upper bound on the order of complexity of a linear active network is the sum of the numbers of tree capacitances and link inductances, defined by a common tree of the voltage and current graph that contains a maximum number of capacitances and a minimum number of inductances. It is valid as far as a common tree exists, and is the lowest possible upper bound if only the network topology is known.

Keywords

NETWORK TOPOLOGY
ACTIVE CIRCUITS
TREES
CAPACITANCES
LINEAR CIRCUITS
INDUCTANCES
UPPER BOUND
2 GRAPH METHOD

This publication has 0 references indexed in Scilit: