Publication detail

Symbolic Simplification by means of Graph Transformations

KOLKA, Z. VLK, M. BIOLEK, D. BIOLKOVÁ, V.

Original Title

Symbolic Simplification by means of Graph Transformations

English Title

Symbolic Simplification by means of Graph Transformations

Type

conference paper

Language

en

Original Abstract

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.

English abstract

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.

Keywords

Symbolic analysis, Topology reduction, Two-graph method, Linear circuits, Circuit theory, CAD tools

RIV year

2011

Released

14.07.2011

Publisher

WSEAS

Location

Corfu, Greece

ISBN

9781618040176

Book

Proceedings of the 5th International Conference on Circuits, Systems and Signals (CSS'11)

Pages from

160

Pages to

164

Pages count

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",
  annote="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.",
  address="WSEAS",
  booktitle="Proceedings of the 5th International Conference on Circuits, Systems and Signals (CSS'11)",
  chapter="74698",
  howpublished="print",
  institution="WSEAS",
  year="2011",
  month="july",
  pages="160--164",
  publisher="WSEAS",
  type="conference paper"
}