Detail publikace

Worst-Case Control Mechanism for Approximate Symbolic Analysis

KOLKA, Z. BIOLKOVÁ, V. BIOLEK, D.

Originální název

Worst-Case Control Mechanism for Approximate Symbolic Analysis

Typ

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

Jazyk

angličtina

Originální abstrakt

The paper deals with a control mechanism for approximate symbolic analysis of the Simplification-Before-Generation class that uses the worst case analysis to incorporate component variations into the ranking mechanism. The traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses a fast algorithm for computing the sensitivities needed for the vertex-based worst-case analysis. An advantage of the proposed approach is that the validity of approximated expression is checked over the tolerance interval of component parameters.

Klíčová slova

Symbolic analysis, Simplification, Error prediction, Worst-case analysis, Linear circuits; CAD tools

Autoři

KOLKA, Z.; BIOLKOVÁ, V.; BIOLEK, D.

Rok RIV

2011

Vydáno

10. 12. 2011

Nakladatel

IEEEAM

Místo

Tenerife, Spain

ISBN

978-1-61804-055-8

Kniha

Proceedings of the International conference on MATHEMATICAL MODELS FOR ENGINEERING SCIENCE (MMES 2011)

Strany od

160

Strany do

164

Strany počet

5

BibTex

@inproceedings{BUT74713,
  author="Zdeněk {Kolka} and Viera {Biolková} and Dalibor {Biolek}",
  title="Worst-Case Control Mechanism for Approximate Symbolic Analysis",
  booktitle="Proceedings of the International conference on MATHEMATICAL MODELS FOR ENGINEERING SCIENCE (MMES 2011)",
  year="2011",
  pages="160--164",
  publisher="IEEEAM",
  address="Tenerife, Spain",
  isbn="978-1-61804-055-8"
}