Detail publikace

Topology Reduction For Approximate Symbolic Analysis

KOLKA, Z. HORÁK, M.

Originální název

Topology Reduction For Approximate Symbolic Analysis

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

The paper deals with an implementation of fast ranking procedure for approximate symbolic analysis based on simplifying the circuit model. The procedure consists of three steps. First, lossless identification of series and parallel connections of two-poles is performed. Second, network elements whose influence on the circuits function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The third step consists in modifying voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model must be checked numerically. A method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one reference frequency point.

Klíčová slova

Symbolic analysis, circuit reduction, numerical methods, linear circuits.

Autoři

KOLKA, Z.; HORÁK, M.

Rok RIV

2010

Vydáno

1. 9. 2010

Nakladatel

IMAPS CS

Místo

Brno

ISBN

978-80-214-4138-5

Kniha

Proc of EDS10 IMAPS CS International Conference

Strany od

173

Strany do

178

Strany počet

6

BibTex

@inproceedings{BUT34382,
  author="Zdeněk {Kolka} and Martin {Horák}",
  title="Topology Reduction For Approximate Symbolic Analysis",
  booktitle="Proc of EDS10 IMAPS CS International Conference",
  year="2010",
  pages="173--178",
  publisher="IMAPS CS",
  address="Brno",
  isbn="978-80-214-4138-5"
}