## Canonical Symbolic Analysis of Large Analog Circuits with Determinant Decision Diagrams (2000)

Venue: | IEEE TRANS. ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS |

Citations: | 21 - 7 self |

### BibTeX

@ARTICLE{Shi00canonicalsymbolic,

author = {C.-J. Richard Shi and Xiangdong Tan},

title = {Canonical Symbolic Analysis of Large Analog Circuits with Determinant Decision Diagrams},

journal = {IEEE TRANS. ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS},

year = {2000},

volume = {19},

pages = {1--18}

}

### OpenURL

### Abstract

Symbolic analog-circuit analysis has many applications, and is especially useful for analog synthesis and testability analysis. Existing approaches rely on two forms of symbolic expression representation: expanded sum-of-product form or arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit, and approximation has to be used. Nested form is not canonical, i.e., many representations exist for a symbolic expression, and manipulations with the nested form are often complicated. 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 determinant decision diagram (DDD)---and performing symbolic analysis by graph manipulations. We showed that DDD construction, as well as many symbolic analysis algorithms, can be performed in time complex...

### Citations

8980 |
Introduction to Algorithmics
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ... determinant corresponds to the minimum cost (shortest) path between the DDD root and the 1-terminal. The shortest path in a DDD can be obtained by a depth-first search, which has the time complexity =-=[15]-=-. A nice property of DDD’s is that after we find the shortest path from a DDD, we can subtract it from the DDD using DDD operation TERMSUBTRACT. We can find the next shortest path in the resulting DDD... |

3128 | Graph-based algorithms for boolean function manipulation
- Bryant
- 1986
(Show Context)
Citation Context ...ion) have time complexity proportional to the DDD sizes. This is superior to both y We remark that ZBDD is a variant of Binary Decision Diagram (BDD) introduced by Akers [1] and popularized by Bryant =-=[2]-=-. Our work is inspired by the success of BDDs as an enabling technology for industrial use of symbolic analysis and formal verification in digital logic design [3]. to appear in IEEE Transactions on C... |

468 | Efficient implementation of a bdd package
- Brace, Rudell, et al.
- 1990
(Show Context)
Citation Context ...gn rule defined in Section III, are not shown. As the basis of implementation, we employ two techniques originally developed by Brace, Rudell and Bryant for implementing decision diagrams efficiently =-=[7]-=-. First, a basic procedure GETVERTEX( ) is to generate (or copy) a vertex for a symbol and two subgraphs and . In the procedure, a hash table is used to keep each vertex unique; vertex elimination and... |

437 |
Asymptotic Waveform Evaluation for Timing Analysis
- Pillage, Rohrer
- 1990
(Show Context)
Citation Context ...decomposition [44]. Finally, it is worth noting that efficient linear(ized) circuit analysis can be accomplished via numerical reduced-order modeling techniques such as asymptotic waveform evaluation =-=[34]-=-, the PVL algorithm [16], and the Arnoldi method [31]. It is very intriguing to combine DDD’s and these techniques for possible symbolic reduced-order modeling.sSHI AND TAN: CANONICAL SYMBOLIC ANALYSI... |

398 |
Binary decision diagrams
- Akers
- 1978
(Show Context)
Citation Context ... (such as sensitivity calculation) have time complexity proportional to the DDD sizes. This is superior to both y We remark that ZBDD is a variant of Binary Decision Diagram (BDD) introduced by Akers =-=[1]-=- and popularized by Bryant [2]. Our work is inspired by the success of BDDs as an enabling technology for industrial use of symbolic analysis and formal verification in digital logic design [3]. to ap... |

278 | Algebraic decision diagrams and their applications
- Bahar, Frohm, et al.
- 1993
(Show Context)
Citation Context ... extensions of BDD’s for multivalued functions and arithmetic applications have been made; for example, multiterminal binary decision diagrams [11]–[13], [20] (also called algebraic decision diagrams =-=[3]-=-), hybrid decision diagrams [14], binary moment diagrams (BMD’s) [6], and several others as described in the book edited by Sasao and Fujita [36]. Among them, Multiterminal BDD’s (MTBDD’s) have been e... |

277 |
SPICE2: A Computer Program to Simulate Semiconductor Circuits", Memorandum No
- Nagel
- 1975
(Show Context)
Citation Context ...ntegrated Circuits 1. Introduction Symbolic analysis is to calculate the behavior or the characteristic of a circuit in terms of symbolic parameters. In contrast to numerical simulators such as SPICE =-=[20]-=- that only provide numerical results, symbolic simulators can express explicitly which circuit parameters determine the circuit behavior. They offer more advantages than numerical simulators in many a... |

251 | Efficient linear circuit analysis by Padé approximation via the Lanczos process
- Feldmann, Freund
- 1995
(Show Context)
Citation Context ...lly, it is worth noting that efficient linear(ized) circuit analysis can be accomplished via numerical reduced-order modeling techniques such as asymptotic waveform evaluation [34], the PVL algorithm =-=[16]-=-, and the Arnoldi method [31]. It is very intriguing to combine DDD’s and these techniques for possible symbolic reduced-order modeling.sSHI AND TAN: CANONICAL SYMBOLIC ANALYSIS OF LARGE ANALOG CIRCUI... |

168 | Multi terminal binary decision diagrams: An efficent data structure for matrix representation - Clarke, Fujita, et al. - 1993 |

152 |
Zero-suppressed bdds for set manipulation in combinatorial problems
- Minato
- 1993
(Show Context)
Citation Context ...bset of all the symbolic parameters. Therefore, we adapt a special data structure called Zerosuppressed Binary Decision Diagrams (ZBDDs) y introduced originally for representing sparse subset systems =-=[19]-=-. This leads to a new graph representation of a symbolic determinant, called Determinant Decision Diagram (DDD). This representation has several advantages over both the expanded and arbitrarily neste... |

126 |
Computer Methods for Circuit Analysis and Design
- Vlach, Singhal
(Show Context)
Citation Context ... Analog Circuits Consider a linear(ized) time-invariant analog circuit. Its system equation can be formulated by, for example, the modified nodal analysis (MNA) approach in the following general form =-=[23]-=-: Tx = w: (5) The circuit unknown vector x may be composed of node voltages and branch currents, and the circuit matrix T is a large sparse symbolic matrix. to appear in IEEE Transactions on Computer-... |

112 | Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification
- Bryant
- 1995
(Show Context)
Citation Context ... Akers [1] and popularized by Bryant [2]. Our work is inspired by the success of BDDs as an enabling technology for industrial use of symbolic analysis and formal verification in digital logic design =-=[3]-=-. to appear in IEEE Transactions on Computer-Aided Design of Integrated Circuits the nested-form and expanded-form representations. This paper is organized as follows: Section 2 introduces the backgro... |

101 | Verification of Arithmetic Functions with Binary Moment Diagrams
- Bryant, Chen
- 1995
(Show Context)
Citation Context ...ations have been made; for example, multiterminal binary decision diagrams [11]–[13], [20] (also called algebraic decision diagrams [3]), hybrid decision diagrams [14], binary moment diagrams (BMD’s) =-=[6]-=-, and several others as described in the book edited by Sasao and Fujita [36]. Among them, Multiterminal BDD’s (MTBDD’s) have been explored for the implementation of matrix algebra. MTBDD’s is an exte... |

71 | Coordinatetransformed arnoldi algorithm for generating guarantee stable reducedorder models
- Silveira, Kamon, et al.
- 1999
(Show Context)
Citation Context ...efficient linear(ized) circuit analysis can be accomplished via numerical reduced-order modeling techniques such as asymptotic waveform evaluation [34], the PVL algorithm [16], and the Arnoldi method =-=[31]-=-. It is very intriguing to combine DDD’s and these techniques for possible symbolic reduced-order modeling.sSHI AND TAN: CANONICAL SYMBOLIC ANALYSIS OF LARGE ANALOG CIRCUITS WITH DDD’S 15 Fig. 17. An ... |

54 |
Symbolic Analysis for Automated Design of Analog Integrated Circuits
- Gielen, Sansen
- 1991
(Show Context)
Citation Context ...olic parameters and the frequency defined at some nominal design points or over some ranges. It can be performed before/during the generation of symbolic terms [6, 14, 21, 28] or after the generation =-=[8, 10, 26]-=-. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [5, 9, 10, 27]. However, both techniques have some major deficiencies. Manipulatio... |

43 |
Eds. Representation of Discrete Functions
- Sasao, Fujita
- 1996
(Show Context)
Citation Context ... this section, we summarize some closely related work in these two areas. We refer the reader to [21] and [26] for comprehensive surveys of symbolic analysis techniques and applications, and [30] and =-=[36]-=- for decision diagrams. A. Comparison with Existing Determinant-Based Symbolic Techniques Previously, determinant expansion has been exploited for symbolic analysis of analog circuits. The work includ... |

40 | Symbolic analysis methods and applications for analog circuits: a tutorial overview - Gielen, Wambacq, et al. - 1990 |

32 | Relaxation-based electrical simulation
- NEWTON, SANGIOVANNI-VINCENTELLI
- 1983
(Show Context)
Citation Context ...mber of DDD vertices, but the number of DDD vertices may grow exponentially with the size of a circuit. Sparse-matrix-based numerical LU decomposition has been observed to run in for typical circuits =-=[33]-=-. Therefore, the straightforward use of exact symbolic expressions—DDD-based or even SCAPP’s sequences of expressions—for numerical evaluation may not offer 5 We note that hierarchical symbolic analys... |

27 |
A unified approach to the approximate symbolic analysis of large analog circuits
- Yu, Sechen
- 1996
(Show Context)
Citation Context ...based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. It can be performed before/during the generation of symbolic terms =-=[6, 14, 21, 28]-=- or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [5, 9, 10, 27]. However, both techniques have ... |

27 |
et al., Maple V Language Reference Manual
- Char
- 1991
(Show Context)
Citation Context ...e1 and rctree2). It may use much more multiplications than SCAPP for those circuits that do not have ladder- or tree-like structures ( and ). 4 We then compare our program with ISAAC [21] and Maple-V =-=[10]-=- for generating the complete sum-of-product expressions of the transfer functions. ISAAC is a well-known special-purpose symbolic analyzer designed for analog integrated circuits. Maple-V is a general... |

26 |
Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams
- Clarke, Fujita, et al.
- 1996
(Show Context)
Citation Context ...alued functions and arithmetic applications have been made; for example, multiterminal binary decision diagrams [11]–[13], [20] (also called algebraic decision diagrams [3]), hybrid decision diagrams =-=[14]-=-, binary moment diagrams (BMD’s) [6], and several others as described in the book edited by Sasao and Fujita [36]. Among them, Multiterminal BDD’s (MTBDD’s) have been explored for the implementation o... |

26 |
Symbolic network analysis
- Lin, M
- 1991
(Show Context)
Citation Context ...posed approach is an application of decision diagram concepts to symbolic network analysis. In this section, we summarize some closely related work in these two areas. We refer the reader to [21] and =-=[26]-=- for comprehensive surveys of symbolic analysis techniques and applications, and [30] and [36] for decision diagrams. A. Comparison with Existing Determinant-Based Symbolic Techniques Previously, dete... |

21 |
A hierarchical network approach to symbolic analysis of large scale networks
- Hassoun, Lin
- 1995
(Show Context)
Citation Context ...hniques--- hierarchical decomposition and symbolic simplification---developed in the past decade. Hierarchical decomposition is to generate symbolic expressions in the nested instead of expanded form =-=[12, 13, 22]-=-. Symbolic simplification is to discard those insignificant terms based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. I... |

19 |
Flowgraph analysis of large electronic networks
- Starzyk, Konczykowska
- 1986
(Show Context)
Citation Context ...hniques--- hierarchical decomposition and symbolic simplification---developed in the past decade. Hierarchical decomposition is to generate symbolic expressions in the nested instead of expanded form =-=[12, 13, 22]-=-. Symbolic simplification is to discard those insignificant terms based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. I... |

16 | Symbolic analysis of large analog circuits with determinant decision diagrams
- Shi, Tan
- 1997
(Show Context)
Citation Context ...acturing Technology Directorate, and in part by Conexant Systems. A preliminary version of this paper was presented at the IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, November 9–13, 1997 =-=[38]-=-. This paper was recommended by Associate Editor M. Fujita. C.-J. R. Shi is with the Department of Electrical Engineering, University of Washington, Seattle, WA 98195 USA (e-mail: cjshi@ee.washington.... |

15 |
Fast Spectrum Computation for Logic Functions using Binary Decision Diagrams
- Fujita, Yang
- 1995
(Show Context)
Citation Context ...cation in normal algebra. We note that several other extensions of BDD’s for multivalued functions and arithmetic applications have been made; for example, multiterminal binary decision diagrams [11]–=-=[13]-=-, [20] (also called algebraic decision diagrams [3]), hybrid decision diagrams [14], binary moment diagrams (BMD’s) [6], and several others as described in the book edited by Sasao and Fujita [36]. Am... |

15 | Hierarchical symbolic analysis of large analog circuits with determinant decision diagrams
- Tan, Shi
- 1998
(Show Context)
Citation Context ...o improve the nu4 Very recently, we showed that by exploiting the design hierarchy and automated partitioning, the DDD-based approach can generate even more compact representations than that of SCAPP =-=[41]-=-, [42].sSHI AND TAN: CANONICAL SYMBOLIC ANALYSIS OF LARGE ANALOG CIRCUITS WITH DDD’S 13 merical accuracy of the solution of a system of linear equations, whereas no special consideration has been give... |

11 |
DC small signal symbolic analysis of large analog integrated circuits
- Hsu, Sechen
- 1994
(Show Context)
Citation Context ...based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. It can be performed before/during the generation of symbolic terms =-=[6, 14, 21, 28]-=- or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [5, 9, 10, 27]. However, both techniques have ... |

11 |
Lazy-expansion of symbolic expression approximation
- Seda, DeGrauwe, et al.
- 1992
(Show Context)
Citation Context ...based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. It can be performed before/during the generation of symbolic terms =-=[6, 14, 21, 28]-=- or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [5, 9, 10, 27]. However, both techniques have ... |

9 |
A new reliable approximation method for expanded symbolic network functions
- Wambacq, Gielen, et al.
- 1996
(Show Context)
Citation Context ...ircuit. For example, for a BiCMOS amplifier that has about 15 node and 25 devices (transistors, diodes, resistors and capacitors), the determinant of the matrix contains more than 10 11 product terms =-=[26]-=-. Any manipulation and evaluation of symbolic expressions will require CPU time at best linear in the number of terms, and therefore have both the time and space complexities exponential in the size o... |

8 |
M.: Analog network testability measurement: A symbolic formulation approach
- Carmassi, Catelani, et al.
- 1991
(Show Context)
Citation Context ...e generation of symbolic terms [6, 14, 21, 28] or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects =-=[5, 9, 10, 27]-=-. However, both techniques have some major deficiencies. Manipulation (other than evaluation) of a Some are surveyed in a paper by F. V. Fern'andez and A. Rodr'iguez-V'azquez [9]. to appear in IEEE Tr... |

8 | A cancellation-free algorithm for the symbolic simulation of large analog circuits - Wambacq, Gielen, et al. - 1992 |

7 |
On simplification techniques for symbolic analysis of analog integrated circuits
- Fernández, Martı́n, et al.
- 1992
(Show Context)
Citation Context ...olic parameters and the frequency defined at some nominal design points or over some ranges. It can be performed before/during the generation of symbolic terms [6, 14, 21, 28] or after the generation =-=[8, 10, 26]-=-. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [5, 9, 10, 27]. However, both techniques have some major deficiencies. Manipulatio... |

7 |
Sensitivity analysis of large linear networks using symbolic program
- Lin
- 1992
(Show Context)
Citation Context ...quez [9]. to appear in IEEE Transactions on Computer-Aided Design of Integrated Circuits nested expression usually requires complicated and time-consuming procedures; e.g., sensitivity calculation in =-=[17]-=- and lazy approximation in [21]. On the other hand, simplified expressions only have a sufficient accuracy at some points or frequency ranges. Even worse, simplification often losses certain informati... |

7 |
Computer generation of symbolic network functions—A new theory and implementation
- Aldersona, Lin
- 1973
(Show Context)
Citation Context ...on with Existing Determinant-Based Symbolic Techniques Previously, determinant expansion has been exploited for symbolic analysis of analog circuits. The work includes the parameter extraction method =-=[2]-=-, the algebraic formulation method [35], and recursive Laplace expansion with minor storage and row/column ordering as implemented in ISAAC [21]. Parameter extraction was developed for handling large ... |

7 |
Algorithms for ASTAP-A network analysis program
- Weeks, Jiminez, et al.
- 1973
(Show Context)
Citation Context ...itive numerical evaluation with the generated code may be subject to the numerical accuracy problem. We note that compiled-code simulation has been studied in the area of numerical circuit simulation =-=[48]-=-, and partial LU decomposition by Gaussian elimination itself has been exploited in the context of circuit tearing, for example as in [49]. If targeted at circuit simulation, LU decomposition by Gauss... |

6 | A Comprehensive Introduction to Linear Algebra - Broida, Williamson - 1989 |

5 |
Symbolic analysis tools—the state of the art
- Fernández, Rodríguez-Vázquez
- 1996
(Show Context)
Citation Context ...e generation of symbolic terms [6, 14, 21, 28] or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects =-=[5, 9, 10, 27]-=-. However, both techniques have some major deficiencies. Manipulation (other than evaluation) of a Some are surveyed in a paper by F. V. Fern'andez and A. Rodr'iguez-V'azquez [9]. to appear in IEEE Tr... |

4 |
Matrix reduction and numerical approximation during computation techniques for symbolic analog circuit analysis
- Chang, MacKey, et al.
- 1992
(Show Context)
Citation Context |

4 |
A New Network Approach to Symbolic Simulation of Large-Scale Networks
- Hassoun, Lin
- 1989
(Show Context)
Citation Context ...hniques--- hierarchical decomposition and symbolic simplification---developed in the past decade. Hierarchical decomposition is to generate symbolic expressions in the nested instead of expanded form =-=[12, 13, 22]-=-. Symbolic simplification is to discard those insignificant terms based on the relative magnitudes of symbolic parameters and the frequency defined at some nominal design points or over some ranges. I... |

3 |
The Maple V Language Reference Manual
- al
- 1991
(Show Context)
Citation Context ...ctivefilter 20 46 82 938.5 52 ladder21 23 64 28657 92783.4 64 ��A741 24 89 374884 -- 7431 big 33 101 7:31 \Theta 10 6 -- 905 - : out of memory. We then compare our program with ISAAC [10] and Mapl=-=e-V [7]-=- in terms of CPU time and memory usage. ISAAC is a well-known special-purpose symbolic analyzer designed for analog integrated circuits. Maple-V is a general-purpose mathematic package capable of solv... |

3 |
Symbolic network analysis—An algebraic formulation
- Sanniti, Puri
- 1980
(Show Context)
Citation Context ...bolic Techniques Previously, determinant expansion has been exploited for symbolic analysis of analog circuits. The work includes the parameter extraction method [2], the algebraic formulation method =-=[35]-=-, and recursive Laplace expansion with minor storage and row/column ordering as implemented in ISAAC [21]. Parameter extraction was developed for handling large sparse matrices with a few symbolic ent... |

2 | Network symbolic analysis for automated fault diagnosis - Liberatore, Manetti, et al. - 1992 |

2 |
Elements of computer-aided analysis
- McCalla, Pederson
- 1971
(Show Context)
Citation Context ...d by a recent survey paper of Gielen, Wambacq and Sansen [11]. Despite of its advantages, symbolic analysis has not been widely used by analog designers, and was once judged as completely inefficient =-=[18]-=-. The root of the difficulty is apparently: the number of product terms in a symbolic expression may increase exponentially with the size of a circuit. For example, for a BiCMOS amplifier that has abo... |

2 |
de Gyvez, "Analog system-level fault diagnosis based on a symbolic method in the frequency domain
- You, S'anchez-Sinencio, et al.
- 1995
(Show Context)
Citation Context ...e generation of symbolic terms [6, 14, 21, 28] or after the generation [8, 10, 26]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects =-=[5, 9, 10, 27]-=-. However, both techniques have some major deficiencies. Manipulation (other than evaluation) of a Some are surveyed in a paper by F. V. Fern'andez and A. Rodr'iguez-V'azquez [9]. to appear in IEEE Tr... |

2 |
Decision Diagrams and Applications for VLSI
- Binary
- 1996
(Show Context)
Citation Context ...lysis. In this section, we summarize some closely related work in these two areas. We refer the reader to [21] and [26] for comprehensive surveys of symbolic analysis techniques and applications, and =-=[30]-=- and [36] for decision diagrams. A. Comparison with Existing Determinant-Based Symbolic Techniques Previously, determinant expansion has been exploited for symbolic analysis of analog circuits. The wo... |

2 | A family of matroid intersection algorithms for the computation of approximated symbolic network functions
- Wambacq, Gielen, et al.
- 1996
(Show Context)
Citation Context ...ofactoring. the problem of finding shortest paths in a DDD, and solved elegantly by an algorithm. We note that the problem itself can be solved efficiently by matroid-intersection-based methods [45], =-=[46]-=-, [51], [52]. We adapted the weighting scheme of Yu and Sechen [51]. A 1-edge originated from vertex is assigned weight , where is the numerical value of symbolic parameter . All the 0-edges are assig... |

2 |
An investigation of ordering, tearing, latency algorithms for the time-domain simulation of large circuits
- Yang
- 1980
(Show Context)
Citation Context ... has been studied in the area of numerical circuit simulation [48], and partial LU decomposition by Gaussian elimination itself has been exploited in the context of circuit tearing, for example as in =-=[49]-=-. If targeted at circuit simulation, LU decomposition by Gaussian elimination has been observed to be less preferred over the Crout method or other methods of LU decomposition [44]. Finally, it is wor... |

2 |
de Gyvez, “Analog system-level fault diagnosis based on a symbolic method in the frequency domain
- You, Sanchez-Sinencio, et al.
- 1995
(Show Context)
Citation Context ...s [25], [37], [45], [51] or after the generation [17], [21], [47]. Exploitation of these techniques has enabled the use of symbolic simulators in several university research projects [9], [19], [21], =-=[50]-=-; however, both techniques have some major deficiencies. Symbolic manipulation (other than numerical evaluation) of a nested expression usually requires complicated and time-consuming procedures; e.g.... |

1 | Symbolic simulation of analog circuits in S- and Z- domain - Wambacq, Gielen, et al. - 1989 |