Graph-Based Symbolic and Symbolic Sensitivity Analysis of Analog Integrated Circuits

Rodriguez-Chavez, S.; Palma-Rodriguez, A. A.; Tlelo-Cuautle, Esteban; Tan, Sheldon X.-D.

doi:10.1007/978-3-642-36329-0_5

Cited by 9 publications

(8 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4b. The graph can be described by the set of equations (4), where the first eq. described branches going into the node Vi, and the second one branch going into the node V2.…”

Section: Using the Simplified Inverting Amplifier Graph For Sensimentioning

confidence: 99%

“…In general, most sensitivity analysis techniques require input as a transfer function that can be obtained by performing linear algebraic or graph operations. Several symbolic techniques have been developed to derive analytical expressions or to transform certain characteristics of a linear network [2], [3], [4], [5], [6], [7], [8]. Generally, the analytical sensitivity analysis would be much easier by using a symbolic approach than a numerical approach where computation cost is a key concern.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Comparison of the Methods of Graphical Solution of Symbolic Sensitivity

Brtnik

2019

2019 29th International Conference Radioelektronika (RADIOELEKTRONIKA)

View full text Add to dashboard Cite

Signal-flow graph (SFG) technique is a very useful tool for a hand analysis of a small and mediumsize networks and/or subnetworks of large systems. Last days, the SFG's have been effectively used for the sensitivity solutions, too. This paper describes the comparison between two graph methods for derivation transfer function: the nullor modified Coates flow graph symbolic analysis and the transformation graphs for symbolic analysis. As is given, in some cases the transformation graphs are more useful thanks to their clarity than standard solving methods.

show abstract

“…4b. The graph can be described by the set of equations (4), where the first eq. described branches going into the node Vi, and the second one branch going into the node V2.…”

Section: Using the Simplified Inverting Amplifier Graph For Sensimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Comparison of the Methods of Graphical Solution of Symbolic Sensitivity

Brtnik

2019

2019 29th International Conference Radioelektronika (RADIOELEKTRONIKA)

View full text Add to dashboard Cite

show abstract

“…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 ]. That way, we introduce herein a new graph-based symbolic technique (GBST) for deriving exact symbolic expressions of analog ICs.…”

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

Self Cite

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

“…The others methods are based on implementation of graph theory for symbolic circuit analysis [7][8][9][10]. In particular, the work in [7] shows the technique based on the modified Coates flow-graph for performing sensitivity analysis.…”

Section: Introductionmentioning

confidence: 99%

“…Another widespread approach is implementation of the modified nodal matrix [10,11]. But obtained results are not compact and include cancellations so the expressions often present only in semisymbolic form.…”

Section: Introductionmentioning

confidence: 99%

A Cancellation-Free Symbolic Sensitivity Technique Based on Network Determinant Expansion

Filaretov

Gorshkov

KURGANOV

2015

Advances in Electrical Engineering

View full text Add to dashboard Cite

The generalization of Bode’s sensitivity analysis technique for all types of the transfer functions and circuit elements is presented in the paper. The proposed formulae for first- and second-order symbolic sensitivity calculation provide the compact size of obtained expression and have the advantages of cancellation-free sum-of-product terms and matrix-free computation. This is achieved by means of the concept of high order summative cofactors and the generalized parameter extraction method. The proposed technique is implemented in symbolic circuit analysis program Cirsym. Illustrative example on symbolic sensitivity circuit analysis and comparison of the presented technique with the transimpedance method and the method based on the modified Coates flow-graph are given.

show abstract

Graph-Based Symbolic and Symbolic Sensitivity Analysis of Analog Integrated Circuits

Cited by 9 publications

References 30 publications

Comparison of the Methods of Graphical Solution of Symbolic Sensitivity

Comparison of the Methods of Graphical Solution of Symbolic Sensitivity

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

A Cancellation-Free Symbolic Sensitivity Technique Based on Network Determinant Expansion

Contact Info

Product

Resources

About