Efficient DDD-based term generation algorithm for analog circuit behavioral modeling

Authors:
Sheldon X.-D. Tan;C.-J. Richard Shi
Affiliations:
University of California, Riverside, CA;University of Washington, Seattle, WA
Venue:
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Year:
2003

Citing 7
Cited 2

Introduction to algorithms

Introduction to algorithms
Binary decision diagrams and applications for VLSI CAD

Binary decision diagrams and applications for VLSI CAD
Interpretable symbolic small-signal characterization of large analog circuits using determinant decision diagrams

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Efficient DDD-based symbolic analysis of large linear analog circuits

Proceedings of the 38th 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
Compact representation and efficient generation of s-expanded symbolic network functions for computer-aided analog circuit design

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

Algorithms for automatic model topology formulation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Numerical Simulation and Modelling of Electronic and Biochemical Systems

Foundations and Trends in Electronic Design Automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient approach to generating symbolic product terms for behavioral modeling of large linear analog circuits is presented. The approach is based on a compact determinant decision diagram (DDD) representation of transfer functions and characteristics of analog circuits. The new algorithm is based on the concept that a dominant term in a DDD graph can be found by searching the shortest path in the graph. But instead of traversing a whole DDD graph each time, we show that a shortest path can be found by just updating a small number of the newly added vertices after the first shortest path is found. Experimental results indicate that the new symbolic term generation algorithm outperforms both pure shortest path based algorithm and dynamic programming based algorithm, which is the fastest symbolic term generation algorithm published so far.