Symbolic Moment Computation for Statistical Analysis of Large Interconnect Networks

Hao, Zuoqiang; Shi, Guoyong; Tan, Sheldon X.-D.; Tlelo‐Cuautle, Esteban

doi:10.1109/tvlsi.2012.2197835

Cited by 5 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Symbolic analysis of analog circuits has been demonstrated to be useful for deriving analytical expressions such as H ( s ) [ 8 – 14 ]. An important contribution on the development of symbolic analysis techniques was the introduction of determinant decision diagrams (DDDs) [ 8 , 9 ], whose advantage is computing symbolic expressions sharing many subexpressions [ 10 , 11 ]. However, it was not realized for deriving exact analytical expressions for CMOS amplifiers [ 15 ].…”

Section: Graph-based Symbolic Techniquementioning

confidence: 99%

Graph-Based Symbolic Technique and Its Application in the Frequency Response Bound Analysis of Analog Integrated Circuits

Tlelo‐Cuautle

Rodriguez-Chavez

Palma-Rodriguez

2014

The Scientific World Journal

View full text Add to dashboard Cite

A new graph-based symbolic technique (GBST) for deriving exact analytical expressions like the transfer function H(s) of an analog integrated circuit (IC), is introduced herein. The derived H(s) of a given analog IC is used to compute the frequency response bounds (maximum and minimum) associated to the magnitude and phase of H(s), subject to some ranges of process variational parameters, and by performing nonlinear constrained optimization. Our simulations demonstrate the usefulness of the new GBST for deriving the exact symbolic expression for H(s), and the last section highlights the good agreement between the frequency response bounds computed by our variational analysis approach versus traditional Monte Carlo simulations. As a conclusion, performing variational analysis using our proposed GBST for computing the frequency response bounds of analog ICs, shows a gain in computing time of 100x for a differential circuit topology and 50x for a 3-stage amplifier, compared to traditional Monte Carlo simulations.

show abstract

Section: Graph-based Symbolic Techniquementioning

confidence: 99%

Graph-Based Symbolic Technique and Its Application in the Frequency Response Bound Analysis of Analog Integrated Circuits

Tlelo‐Cuautle

Rodriguez-Chavez

Palma-Rodriguez

2014

The Scientific World Journal

View full text Add to dashboard Cite

show abstract

Efficient generation of compact symbolic network functions in a nested rational form

Filaretov

Gorshkov

2020

Circuit Theory & Apps

View full text Add to dashboard Cite

SummaryThis paper presents the extension of generalized parameter extraction method for direct circuit function generation in a fully symbolic form of rational expressions or a nested s‐expanded polynomial. The new formula for implicit extraction of parameters that allows effective factoring by grouping of determinants of circuits containing any linear models of active elements, such as controlled sources, nullors, and pathological mirrors, is proposed. The concept of nullor with parameter is used for implicit extraction. The rules of optimal selection of parameters for extraction are presented. The proposed algorithm of symbolic analysis is implemented in the CirSym program, which is available online. The paper discusses the results of automatic analysis of several large active circuits, as well as determinants of matrixes and passive topologies, in terms of compact size and minimization of the number of arithmetic operations. Experimental results demonstrate that the expressions of determinants derived by CirSym are more compact than the results of the factorization algorithms of commercial computer algebra systems. The comparison with several other symbolic analysis algorithms shows that CirSym is the only available program that provides the exact calculation of the symbolic function of large circuits in the s‐expanded form with every coefficient being a compact‐nested expression.

show abstract

Simplified symbolic transfer function factorization using combined artificial bee colony and simulated annealing

Shokouhifar

Jalali

2017

Applied Soft Computing

View full text Add to dashboard Cite

Symbolic Moment Computation for Statistical Analysis of Large Interconnect Networks

Cited by 5 publications

References 37 publications

Graph-Based Symbolic Technique and Its Application in the Frequency Response Bound Analysis of Analog Integrated Circuits

Graph-Based Symbolic Technique and Its Application in the Frequency Response Bound Analysis of Analog Integrated Circuits

Efficient generation of compact symbolic network functions in a nested rational form

Simplified symbolic transfer function factorization using combined artificial bee colony and simulated annealing

Contact Info

Product

Resources

About