Introduction to algorithms
Interactive AC modeling and characterization of analog circuits via symbolic analysis
Analog Integrated Circuits and Signal Processing
Symbolic analysis of simplified transfer functions
Analog Integrated Circuits and Signal Processing - Special issue on symbolic analysis of analog circuits: techniques and applications
Symbolic analysis of large-scale networks using a hierarchical signal flowgraph approach
Analog Integrated Circuits and Signal Processing - Special issue on symbolic analysis of analog circuits: techniques and applications
Formula approximation for flat and hierarchical symbolic analysis
Analog Integrated Circuits and Signal Processing - Special issue on symbolic analysis of analog circuits: techniques and applications
A perturbation approach to the symbolic analysis of analog circuits
A perturbation approach to the symbolic analysis of analog circuits
Lazy-expansion symbolic expression approximation in SYNAP
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Symbolic Analysis for Automated Design of Analog Integrated Circuits
Symbolic Analysis for Automated Design of Analog Integrated Circuits
Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques
Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Circuit complexity reduction for symbolic analysis of analog integrated circuits
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An Algorithm for Numerical Reference Generation in Symbolic Analysis of Large Analog Circuits
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Hi-index | 0.00 |
This paper describes a unified approach to the approximate symbolic analysis of large linearized analog circuits. It combines two new approximation-during-computation strategies with a variation of the classical two-graph tree enumeration method. The first strategy is to generate common trees of the two-graphs, and therefore the product terms in the symbolic network function, in the decreasing order of magnitude. The second approximation strategy is the sensitivity-based simplification of two-graphs, which excludes from the two-graphs many circuit elements that have little effect on the network function being derived. Our approach is therefore able to symbolically analyze much larger analog integrated circuits than previously reported, using complete small signal models for the semiconductor devices. We show accurate yet reasonably sized symbolic network functions for integrated circuits with up to 39 transistors whereas previous approaches were limited to less than 15.