Title :
Symbolic network analysis with the valid trees and the valid tree-pairs
Author_Institution :
Telecommun. Eng. Inst., PLA Air Force Eng. Univ., Xi´ia
Abstract :
The valid tree and the valid tree-pair as well as their values are defined. Algorithms to look for all valid trees and valid tree-pairs and to obtain their values are given. A theorem points out that the determinant of a closed network is equal to the sum of all valid tree´s values and all valid tree-pair´s values of the network. A unified topological formula for general active circuits to solve various types of symbolic network functions is put forward
Keywords :
active networks; circuit analysis computing; network topology; symbol manipulation; trees (mathematics); active circuits; symbolic network analysis; symbolic network functions; unified topological formula; valid tree-pairs; valid trees; Active circuits; Active inductors; Admittance; Analog circuits; Equations; Impedance; Transfer functions; Tree graphs; Virtual colonoscopy; Voltage control;
Conference_Titel :
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7803-6685-9
DOI :
10.1109/ISCAS.2001.922053
