Efficient DDD-based symbolic analysis of large linear analog circuits

Authors:
Wim Verhaegen;Georges Gielen
Affiliations:
Katholieke Universiteit Leuven, Dept. ESAT-MICAS, Kasteelpark Arenberg 10, B-3001 Leuven, Belgium;Katholieke Universiteit Leuven, Dept. ESAT-MICAS, Kasteelpark Arenberg 10, B-3001 Leuven, Belgium
Venue:
Proceedings of the 38th annual Design Automation Conference
Year:
2001

Citing 8
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Interactive AC modeling and characterization of analog circuits via symbolic analysis

Analog Integrated Circuits and Signal Processing
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
Symbolic analysis of large analog circuits with determinant decision diagrams

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Lazy-expansion symbolic expression approximation in SYNAP

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Multi-terminal determinant decision diagrams: a new approach to semi-symbolic analysis of analog integrated circuits

Proceedings of the 37th Annual Design Automation Conference
Symbolic Analysis for Automated Design of Analog Integrated Circuits

Symbolic Analysis for Automated Design of Analog Integrated Circuits
Canonical symbolic analysis of large analog circuits with determinant decision diagrams

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Fast, Layout-Inclusive Analog Circuit Synthesis using Pre-Compiled Parasitic-Aware Symbolic Performance Models

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Efficient DDD-based term generation algorithm for analog circuit behavioral modeling

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new technique for generating approaximate symbolic expressions for network functions in linear(ized) analog circuits is presented. It is based on the compact determinant decision diagram (DDD) representation of the circuit. An implementation of a term generation algorithm is given and its performance is compared to a matroid-based algorithm. Experimental results indicate that our approach is the fastest reported algorithm so far for this application.