DocumentCode :
465494
Title :
Topology Transformations for Symbolic Analysis
Author :
Kolka, Zdenek ; Vlk, Martin ; Biolek, Dalibor ; Biolkova, Viera
Author_Institution :
Brno Univ. of Technol., Brno
Volume :
1
fYear :
2006
fDate :
6-9 Aug. 2006
Firstpage :
448
Lastpage :
452
Abstract :
This paper deals with circuit topology transformations for approximate symbolic analysis of linearized circuits. The method is based on two-graph approach. The structure of current and voltage graphs is modified in order to decrease the number of common spanning trees, i.e. the number of symbolic terms.
Keywords :
graph theory; network analysis; network topology; circuit topology transformations; linearized circuits; symbolic analysis; two-graph approach; Admittance; Circuit analysis; Circuit topology; Contracts; Frequency; Heuristic algorithms; Kirchhoff´s Law; Paper technology; Tree graphs; Voltage;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2006. MWSCAS '06. 49th IEEE International Midwest Symposium on
Conference_Location :
San Juan
ISSN :
1548-3746
Print_ISBN :
1-4244-0172-0
Electronic_ISBN :
1548-3746
Type :
conf
DOI :
10.1109/MWSCAS.2006.382095
Filename :
4267172
Link To Document :
بازگشت