Detail publikace

Topology Reduction For Approximate Symbolic Analysis

KOLKA, Z. HORÁK, M.

Originální název

Topology Reduction For Approximate Symbolic Analysis

Anglický název

Topology Reduction For Approximate Symbolic Analysis

Jazyk

en

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.

Anglický 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.

Dokumenty

BibTex


@inproceedings{BUT34382,
  author="Zdeněk {Kolka} and Martin {Horák}",
  title="Topology Reduction For Approximate Symbolic Analysis",
  annote="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.",
  address="IMAPS CS",
  booktitle="Proc of EDS10 IMAPS CS International Conference",
  chapter="34382",
  howpublished="print",
  institution="IMAPS CS",
  year="2010",
  month="september",
  pages="173--178",
  publisher="IMAPS CS",
  type="conference paper"
}