“…We propose in this paper the generalization of Hoang formula and Bode's technique for all types of transfer functions and circuit elements, based on implementation of the concept of higher order summative cofactors (HOSC) [12][13][14][15] instead of ordinary algebraic cofactors and computation of HOSC by means of GPEM [16][17][18][19][20][21].…”
Section: Theoretical Basis Of the Proposed Methodsmentioning
confidence: 99%
“…where Δ = Δ ( +0)( +0) , Δ = Δ ( +0)( +0) , and so on. In accordance with GPEM basis [16][17][18][19][20][21] we consider the sums of row (column) indexes as a result of nullator (norator) connection to the network nodes corresponding to the indexes.…”
Section: Higher Order Summative Cofactors and Generalizedmentioning
confidence: 99%
“…In this paper we propose a cancellation-free symbolic sensitivity technique for computation of compact expression. The first-and second-order symbolic sensitivities formulas for all types of the transfer functions and circuit elements are derived by means of the concept of higher order summative cofactors (HOSC) [12][13][14][15] and generalized parameter extraction method (GPEM) [16][17][18][19][20][21] to avoid drawbacks of the previous methods mentioned above.…”
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.
“…We propose in this paper the generalization of Hoang formula and Bode's technique for all types of transfer functions and circuit elements, based on implementation of the concept of higher order summative cofactors (HOSC) [12][13][14][15] instead of ordinary algebraic cofactors and computation of HOSC by means of GPEM [16][17][18][19][20][21].…”
Section: Theoretical Basis Of the Proposed Methodsmentioning
confidence: 99%
“…where Δ = Δ ( +0)( +0) , Δ = Δ ( +0)( +0) , and so on. In accordance with GPEM basis [16][17][18][19][20][21] we consider the sums of row (column) indexes as a result of nullator (norator) connection to the network nodes corresponding to the indexes.…”
Section: Higher Order Summative Cofactors and Generalizedmentioning
confidence: 99%
“…In this paper we propose a cancellation-free symbolic sensitivity technique for computation of compact expression. The first-and second-order symbolic sensitivities formulas for all types of the transfer functions and circuit elements are derived by means of the concept of higher order summative cofactors (HOSC) [12][13][14][15] and generalized parameter extraction method (GPEM) [16][17][18][19][20][21] to avoid drawbacks of the previous methods mentioned above.…”
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.
“…Then we will subtract the second equation from the first one in (10). Again, this subtraction can be shown with opposite tags for these nodes.…”
Section: B Trees With Norators and CMmentioning
confidence: 96%
“…1(d) correspondingly. VM and CM are successfully used in the analysis and synthesis of electronic circuits [7]- [10]. Unlike the nullor, these elements have three poles (one of which is ground).…”
In this paper the method of circuit synthesis using transformation of trees with pathological elements is discussed. The generalization and mathematical proof of equivalent transformations of trees with mirror and/or nullor pathological elements are presented. Algorithm of generating equivalent trees with these pathological elements is also suggested. It is based on tagging of the vertices (nodes) by taking into account a type of pathological elements between these nodes and preserving these tags during transformations of trees. Illustrative example of universal filter synthesis by means of proposed algorithm is included.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.