Name
Abstract | ||
|---|---|---|
This paper presents a novel method using multi-objective optimization algorithm to automatically find the best solution from a topology library of analog circuits. Firstly this method abstracts, the Pareto-front of each topology in the library by SPICE simulation. Then, the Pareto-front of the topology library is abstracted from the individual Pareto-fronts of topologies in the library followed by the theorem we proved. The best solution which is defined as the nearest point to specification on the Pareto-front of the topology library is then calculated by the equations derived from collinearity theorem. After the local searching using Nelder-Mead method maps the calculated best solution backs to design variable space, the non-dominated best solution is obtained. Comparing to the traditional optimization methods using single-objective optimization algorithms, this work can efficiently find the best non-dominated solution front multiple topologies for different specifications without additional time-consuming optimizing iterations. The experiments demonstrate that this method is feasible and practical in actual analog designs especially for uncertain or variant multi-dimensional specifications. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transfun.E92.A.3035 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
analog design, topology selection and sizing, automation, multi-objective optimization, Pareto-optimality | Mathematical optimization,Automation,Multi-objective optimization,Network topology,Theoretical computer science,Pareto principle,Mathematics | Journal |
Volume | Issue | ISSN |
E92A | 12 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Liu | 1 | 6 | 1.16 |
| Masato Yoshioka | 2 | 91 | 12.46 |
| Katsumi Homma | 3 | 18 | 5.36 |
| Toshiyuki Shibuya | 4 | 89 | 11.80 |