On simplification techniques for symbolic analysis of analog integrated circuits

Abstract

The topic of formula simplification for symbolic analyzers is addressed. Previously reported criteria for flat analysis approaches are briefly reviewed, and their limitations are illustrated via examples of practical circuits. An adaptive simplification method using pole/zero monitoring for error control is given to alleviate some of these problems. Then a new simplification strategy is presented which takes into account potential ranges of variation of the different symbolic parameters and which overcomes the drawbacks of previous criteria. An algorithm for the approximation of symbolic formulas obtained via hierarchical symbolic analysis approaches is also outlined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>