Publication detail

Topology Transformations for Symbolic Analysis

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

Original Title

Topology Transformations for Symbolic Analysis

English Title

Topology Transformations for Symbolic Analysis

Type

conference paper

Language

en

Original 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.

English 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

Symbolic analysis, graph theory.

RIV year

2006

Released

20.08.2006

Publisher

IEEE

Location

Puerto Rico, USA

ISBN

978-1-4244-0172-7

Book

Proc. of the 2006 IEEE Int. Midwest Symposium on Circuits and Systems [CD-ROM]

Pages from

448

Pages to

452

Pages count

5

Documents

BibTex


@inproceedings{BUT18964,
  author="Zdeněk {Kolka} and Martin {Vlk} and Dalibor {Biolek} and Viera {Biolková}",
  title="Topology Transformations for Symbolic Analysis",
  annote="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.",
  address="IEEE",
  booktitle="Proc. of the 2006 IEEE Int. Midwest Symposium on Circuits and Systems [CD-ROM]",
  chapter="18964",
  institution="IEEE",
  year="2006",
  month="august",
  pages="448--452",
  publisher="IEEE",
  type="conference paper"
}