Detail publikačního výsledku

Simplification before generation using sparse matrices

Martin Horák, Zdeněk Kolka

Originální název

Simplification before generation using sparse matrices

Anglický název

Simplification before generation using sparse matrices

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

This contribution describes an implementation of an algorithm for the approximate symbolic analysis of linearized circuits, known as Simplification Before Generation (SBG). The implementation uses the Sherman-Morison formula and a sparse matrix technique for computing an inverse matrix that is required for determining negligible elements in an analyzed circuit. The effectivity of these techniques has been compared on benchmarking and real circuits.

Anglický abstrakt

This contribution describes an implementation of an algorithm for the approximate symbolic analysis of linearized circuits, known as Simplification Before Generation (SBG). The implementation uses the Sherman-Morison formula and a sparse matrix technique for computing an inverse matrix that is required for determining negligible elements in an analyzed circuit. The effectivity of these techniques has been compared on benchmarking and real circuits.

Klíčová slova

topological simplification, analog circuit, sparse matrice, Sherman-Morison formula

Klíčová slova v angličtině

topological simplification, analog circuit, sparse matrice, Sherman-Morison formula

Autoři

Martin Horák, Zdeněk Kolka

Vydáno

15.09.2005

Nakladatel

VUT v Brně

Místo

Brno, Czech republic

ISBN

80-214-2990-9

Kniha

Proceedings of Electronic Devices and Systems IMAPS CS International Conference 2005

Strany od

25

Strany počet

6

BibTex

@inproceedings{BUT14994,
  author="Martin {Horák} and Zdeněk {Kolka}",
  title="Simplification before generation using sparse matrices",
  booktitle="Proceedings of Electronic Devices and Systems IMAPS CS International Conference 2005",
  year="2005",
  pages="6",
  publisher="VUT v Brně",
  address="Brno, Czech republic",
  isbn="80-214-2990-9"
}