Title :
Order of complexity of linear active networks and a common tree in the 2-graph method
Author_Institution :
Kyoto University, Department of Electrical Engineering, Kyoto, Japan
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 :
active networks; network topology; trees (mathematics); 2 graph method; active circuits; capacitances; inductances; linear circuits; network topology; trees; upper bound;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19720395
