Publication detail

Topology Reduction for Approximate Symbolic Analysis

KOLKA, Z. VLK, M. HORÁK, M.

Original Title

Topology Reduction for Approximate Symbolic Analysis

English Title

Topology Reduction for Approximate Symbolic Analysis

Type

journal article - other

Language

en

Original Abstract

The paper deals with a procedure for approximate symbolic analysis of linear circuits based on simplifying the circuit model. The procedure consists of two main steps. First, network elements whose influence on the circuit function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The second step consists in modifying the voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model is ranked numerically. A fast method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one frequency point.

English abstract

The paper deals with a procedure for approximate symbolic analysis of linear circuits based on simplifying the circuit model. The procedure consists of two main steps. First, network elements whose influence on the circuit function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The second step consists in modifying the voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model is ranked numerically. A fast method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one frequency point.

Keywords

Symbolic analysis, two-graph method, circuit reduction, linear circuits, frequency domain.

RIV year

2011

Released

01.04.2011

Pages from

252

Pages to

256

Pages count

5

BibTex


@article{BUT72975,
  author="Zdeněk {Kolka} and Martin {Vlk} and Martin {Horák}",
  title="Topology Reduction for Approximate Symbolic Analysis",
  annote="The paper deals with a procedure for approximate symbolic analysis of linear circuits based on simplifying the circuit model. The procedure consists of two main steps. First, network elements whose influence on the
circuit function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The second step consists in modifying the voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model is ranked numerically. A fast method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one frequency point.",
  chapter="72975",
  journal="Radioengineering",
  number="1",
  volume="20",
  year="2011",
  month="april",
  pages="252--256",
  type="journal article - other"
}