Publication detail

Two-Graph Implementation of SBG method

HORÁK, M., KOLKA, Z.

Original Title

Two-Graph Implementation of SBG method

English Title

Two-Graph Implementation of SBG method

Type

conference paper

Language

en

Original Abstract

This contribution describes a new algorithm for the approximate symbolic analysis of linearized circuits known as simplification before generation (SBG). The simplification procedure is based on the well-known two-graph method. The method reduces common spanning trees of the voltage and current graph by changing their topology without producing terms that have no origin in the original expression. An approximation is done at topological base so approximate symbolic expression can be obtained from the simplified circuit by any matrix or graph method.

English abstract

This contribution describes a new algorithm for the approximate symbolic analysis of linearized circuits known as simplification before generation (SBG). The simplification procedure is based on the well-known two-graph method. The method reduces common spanning trees of the voltage and current graph by changing their topology without producing terms that have no origin in the original expression. An approximation is done at topological base so approximate symbolic expression can be obtained from the simplified circuit by any matrix or graph method.

Keywords

approximate symbolic analysis, simplification before generation, two-graph method, modified nodal analysis

RIV year

2004

Released

02.09.2004

Publisher

SEI-UTKO

ISBN

80-214-2684-5

Book

Proceedings of the conference TSP 2004

Edition number

1

Pages from

83

Pages to

86

Pages count

4

BibTex


@inproceedings{BUT11432,
  author="Martin {Horák} and Zdeněk {Kolka}",
  title="Two-Graph Implementation of SBG method",
  annote="This contribution describes a new algorithm for the approximate symbolic analysis of linearized circuits known as simplification before generation (SBG). The simplification procedure is based on the well-known two-graph method. The method reduces common spanning trees of the voltage and current graph by changing their topology without producing terms that have no origin in the original expression. An approximation is done at topological base so approximate symbolic expression can be obtained from the simplified circuit by any matrix or graph method.",
  address="SEI-UTKO",
  booktitle="Proceedings of the conference TSP 2004",
  chapter="11432",
  institution="SEI-UTKO",
  year="2004",
  month="september",
  pages="83",
  publisher="SEI-UTKO",
  type="conference paper"
}