Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
KOLKA, Z.; VLK, M.; BIOLEK, D.; BIOLKOVÁ, V.
Originální název
Symbolic Simplification by means of Graph Transformations
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
The paper deals with an effective method for approximate symbolic analysis of linear circuits based on nontrivial transformations of voltage and current graphs. The method is based on eliminating the lowvoltage branches from high-voltage loops and the low-current branches from high-current nodes, which simplifies circuit equations and the final symbolic formula. This allows reaching a higher degree of simplification in comparison with the simple edge deletion or contraction used in previous methods. The paper describes how the branches with low voltage or current can be identified and removed.
Anglický abstrakt
Klíčová slova
Symbolic analysis, Topology reduction, Two-graph method, Linear circuits, Circuit theory, CAD tools
Klíčová slova v angličtině
Autoři
Rok RIV
2012
Vydáno
14.07.2011
Nakladatel
WSEAS
Místo
Corfu, Greece
ISBN
9781618040176
Kniha
Proceedings of the 5th International Conference on Circuits, Systems and Signals (CSS'11)
Strany od
160
Strany do
164
Strany počet
5
BibTex
@inproceedings{BUT74698, author="Zdeněk {Kolka} and Martin {Vlk} and Dalibor {Biolek} and Viera {Biolková}", title="Symbolic Simplification by means of Graph Transformations", booktitle="Proceedings of the 5th International Conference on Circuits, Systems and Signals (CSS'11)", year="2011", pages="160--164", publisher="WSEAS", address="Corfu, Greece", isbn="9781618040176" }