Canonical symbolic analysis of large analog circuits withdeterminant decision diagrams

Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. It consists of representing the symbolic determinant of a circuit matrix by a graph-called a determinant decision diagram (DDD)-and performing symbolic analysis by graph manipulations. We show that DDD construction, as well as many symbolic analysis algorithms, takes time almost linear in the number of DDD vertices. We describe an efficient DDD-vertex ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, the numbers of DDD vertices are several orders of magnitude less than the numbers of product terms. The algorithms have been implemented and compared respectively to symbolic analyzers ISAAC and Maple-V in generating the expanded sum-of-product expressions, and SCAPP in generating the nested sequences of expressions.

[1]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[2]  P. Lin.  Symbolic network analysis , 1991 .

[3]  Jacob K. White,et al.  A coordinate-transformed Arnoldi algorithm for generating guaranteed stable reduced-order models of RLC circuits , 1996, ICCAD 1996.

[4]  Alberto L. Sangiovanni-Vincentelli,et al.  Relaxation-based electrical simulation , 1983, IEEE Transactions on Electron Devices.

[5]  Ping Yang.  An Investigation of Ordering, Tearing, and Latency Algorithms for the Time-Domain Simulation of Large Circuits , 1980 .

[6]  Masahiro Fujita,et al.  Fast spectrum computation for logic functions using binary decision diagrams , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[7]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[10]  Marcantonio Catelani,et al.  Analog network testability measurement: a symbolic formulation approach , 1991 .

[11]  Donald O. Pederson,et al.  Elements of Computer-Aided Circuit Analysis , 1971 .

[12]  Georges Gielen,et al.  Symbolic analysis for automated design of analog integrated circuits , 1991, The Kluwer international series in engineering and computer science.

[13]  P. Wambacq,et al.  A family of matroid intersection algorithms for the computation of approximated symbolic network functions , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[14]  Bruce W. Char,et al.  Maple V Language Reference Manual , 1993, Springer US.

[15]  S. Gill Williamson,et al.  A Comprehensive Introduction to Linear Algebra , 1989 .

[16]  C.-J. Richard Shi,et al.  Symbolic analysis of large analog circuits with determinant decision diagrams , 1997, ICCAD 1997.

[17]  M. M. Hassoun,et al.  A hierarchical network approach to symbolic analysis of large-scale networks , 1995 .

[18]  Qicheng Yu,et al.  A unified approach to the approximate symbolic analysis of large analog integrated circuits , 1996 .

[19]  R. Bryant.  Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[20]  P. M. Lin,et al.  A new network approach to symbolic simulation of large-scale networks , 1989, IEEE International Symposium on Circuits and Systems,.

[21]  Peddapullaiah Sannuti,et al.  Symbolic network analysis-An algebraic formulation , 1980 .

[22]  Georges Gielen,et al.  A cancellation-free algorithm for the symbolic simulation of large analog circuits , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[23]  J. Starzyk,et al.  Flowgraph analysis of large electronic networks , 1986 .

[24]  Kishore Singhal,et al.  Computer Methods for Circuit Analysis and Design , 1983 .

[25]  Efficient derivation of exact s-expanded symbolic expressions for behavioral modeling of analog circuits , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[26]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[27]  W. Fichtner,et al.  Lazy-expansion symbolic expression approximation in SYNAP , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[28]  P. M. Lin,et al.  Sensitivity analysis of large linear networks using symbolic programs , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[29]  Georges Gielen,et al.  Symbolic analysis methods and applications for analog circuits: a tutorial overview , 1994, Proc. IEEE.

[30]  Lawrence T. Pileggi,et al.  Asymptotic waveform evaluation for timing analysis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[31]  A. Rodriguez-Vazquez,et al.  Symbolic analysis tools-the state of the art , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[32]  Jer-Jaw Hsu,et al.  DC small signal symbolic analysis of large analog integrated circuits , 1994 .

[33]  Georges Gielen,et al.  A new reliable approximation method for expanded symbolic network functions , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[34]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[35]  E. Clarke,et al.  Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams , 1996 .

[36]  Sheldon X.-D. Tan,et al.  Interpretable symbolic small-signal characterization of large analog circuits using determinant decision diagrams , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[37]  J. Pineda de Gyvez,et al.  Analog system-level fault diagnosis based on a symbolic method in the frequency domain , 1995 .

[38]  R. Bryant,et al.  Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .

[39]  A. Jimenez,et al.  Algorithms for ASTAP--A network-analysis program , 1973 .

[40]  Qicheng Yu,et al.  Efficient approximation of symbolic network functions using matroid intersection algorithms , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[41]  J.L. Huertas,et al.  On simplification techniques for symbolic analysis of analog integrated circuits , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[42]  G. E. Alderson,et al.  Computer generation of symbolic network functions-A new theory and implementation , 1973 .

[43]  C.-J.R. Shi,et al.  Hierarchical symbolic analysts of large analog circuits with determinant decision diagrams , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[44]  Roland W. Freund,et al.  Efficient linear circuit analysis by Pade´ approximation via the Lanczos process , 1994, EURO-DAC '94.

[45]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[46]  José Luis Huertas,et al.  Accurate simplification of large symbolic formulae , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.