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

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.

[1]  Vladimir Filaretov,et al.  Generalized Parameter Extraction Method in Symbolic Network Analysis , 2003 .

[2]  P. M. Chirlian,et al.  Application of a Bilinear Theorem to Network Sensitivity , 1965 .

[3]  Rob A. Rutenbar,et al.  Flowgraph Analysis of Large Electronic Networks , 2002 .

[4]  Vladimir F. Filaretov,et al.  The Generalization of the Extra Element Theorem for Symbolic Circuit Tolerance Analysis , 2011, J. Electr. Comput. Eng..

[5]  I. Asenova,et al.  Multiparameter symbolic sensitivity analysis of active circuits by using nullor model and modified Coates flow graph , 2012, 2012 ELEKTRO.

[6]  Konstantin Gorshkov,et al.  Topological analysis of active networks containing pathological mirror elements , 2013, 2013 IEEE XXXIII International Scientific Conference Electronics and Nanotechnology (ELNANO).

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

[8]  S. Lasota.  Multilevel hierarchical always cancellation-free symbolic analysis method for large electric networks , 2013 .

[9]  H. W. Bode,et al.  Network analysis and feedback amplifier design , 1945 .

[10]  Shu-Park Chan,et al.  Topological formulation of symbolic network functions and sensitivity analysis of active networks , 1974 .

[11]  V. Filaretov,et al.  Transconductance realization of block-diagrams of electronic networks , 2008, 2008 International Conference on Signals and Electronic Systems.

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

[14]  Guoyong Shi,et al.  Variational analog integrated circuit design via symbolic sensitivity analysis , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[15]  Benedykt Rodanski,et al.  Calculation of Symbolic Sensitivities for Large-Scale Circuits in the Sequence of Expressions Form via the Transimpedance Method , 2004 .

[16]  Huiying Yang,et al.  Efficient symbolic sensitivity analysis of analog circuits using element-coefficient diagrams , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[17]  L. Dumitriu,et al.  Sensitivity analysis of analog circuits based on a modified nodal approach , 2014, 2014 International Conference on Optimization of Electrical and Electronic Equipment (OPTIM).

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

[19]  E. V. Sørensen.  General relations governing the exact sensitivity of linear networks , 1967 .

[20]  Sheldon X.-D. Tan,et al.  Graph-Based Symbolic and Symbolic Sensitivity Analysis of Analog Integrated Circuits , 2013 .