2015
DOI: 10.1142/s0218126615500565
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Simplified Symbolic Analysis of Analog Circuits Using Modified Nodal Analysis and Genetic Algorithm

Abstract: In this paper, a hybrid methodology based on modi¯ed nodal analysis (MNA) and genetic algorithm (GA) is presented for simpli¯ed symbolic small-signal analysis of analog circuits containing semiconductor devices like MOSFETs. At¯rst, the circuit is analyzed by the MNA, and the derived exact continuous-time transfer function is automatically simpli¯ed via GA. We propose a new multi-objective criterion for symbolic simpli¯cation of continuous-time transfer functions, which can be performed by such optimization al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…The objectives of the proposed multi‐objective optimization problem are not only to find the most simplified symbolic transfer functions with the minimum number of terms but also to minimize errors between the exact and simplified expressions while satisfying the defined constraints. So, this is a constrained multi‐objective optimization problem 22,33,34 . The proposed algorithm must be executed three times while satisfying the constraints for simplification of the three symbolic expressions of trueVn,out2¯, A v and NF .…”
Section: Proposed Simplification Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…The objectives of the proposed multi‐objective optimization problem are not only to find the most simplified symbolic transfer functions with the minimum number of terms but also to minimize errors between the exact and simplified expressions while satisfying the defined constraints. So, this is a constrained multi‐objective optimization problem 22,33,34 . The proposed algorithm must be executed three times while satisfying the constraints for simplification of the three symbolic expressions of trueVn,out2¯, A v and NF .…”
Section: Proposed Simplification Methodologymentioning
confidence: 99%
“…So, this is a constrained multi-objective optimization problem. 22,33,34 The proposed algorithm must be executed three times while satisfying the constraints for simplification of the three symbolic expressions of V 2 n,out , A v and NF. There are six objective functions, all to be minimized.…”
Section: Objective Functionmentioning
confidence: 99%
“…Recently, various swarm and evolutionary metaheuristic algorithms [29][30][31][32][33][34] have been applied for the simplified symbolic analysis of OTAs. In these techniques, different criteria such as the magnitude error, phase error, and pole/zero displacements, have been used to evaluate feasible solutions generated by the metaheuristic algorithm.…”
Section: Symbolic Simplification Techniquesmentioning
confidence: 99%
“…Importantly, the MNA method has become a commodity for electrical circuit simulators [43]. To the best of our knowledge, MNA has been first used in PSpice and since then by most Spice-like simulators [39,56,55,37,54,28,6].…”
mentioning
confidence: 99%