Symbolic Simplification by means of Graph Transformations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU94751" target="_blank" >RIV/00216305:26220/11:PU94751 - isvavai.cz</a>
Alternative codes found
RIV/60162694:G43__/11:00449113
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Symbolic Simplification by means of Graph Transformations
Original language description
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.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 5th International Conference on Circuits, Systems and Signals (CSS'11)
ISBN
9781618040176
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
160-164
Publisher name
WSEAS
Place of publication
Corfu, Greece
Event location
Corfu
Event date
Jul 14, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)