2008
DOI: 10.1016/j.vlsi.2007.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Classification of analog synthesis tools based on their architecture selection mechanisms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0
1

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(16 citation statements)
references
References 96 publications
(134 reference statements)
0
15
0
1
Order By: Relevance
“…Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design [27]. 2 This formulation is valid for minimization problems. A simple change of sign applies for maximization.…”
Section: Generation Of Pareto-optimal Performance Frontsmentioning
confidence: 99%
See 1 more Smart Citation
“…Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design [27]. 2 This formulation is valid for minimization problems. A simple change of sign applies for maximization.…”
Section: Generation Of Pareto-optimal Performance Frontsmentioning
confidence: 99%
“…Key tasks in any analog design automation flow are topology selection and topology sizing [1], [2]. Given a set of design specifications, the first task refers to the selection of an appropriate topology, among a set of functionally equivalent ones, that can meet the specifications.…”
Section: Introductionmentioning
confidence: 99%
“…Their potentials in analog circuit design automation still need to be exploited. (2) The constraint handling problem is very important in analog circuit design, especially for high performance circuits, which are always highly constrained. Most reported synthesis methods use penalty functions to handle constraints, and few of them investigated solution algorithms for high performance design problems.…”
Section: Related Workmentioning
confidence: 99%
“…Different penalty coefficients were used in each of the 15 runs and the best result among them is shown in Table 12. 2 The comparison of computation times is shown in Table 13.…”
Section: Benchmark Problems For Constrained Optimizationmentioning
confidence: 99%
See 1 more Smart Citation