An efficient method of Pareto-optimal front generation for analog circuits

被引:1
|
作者
Kundu, Sudip [1 ]
Mandal, Pradip [2 ]
机构
[1] Birla Inst Technol Mesra, Elect Commun Engn, Ranchi, Bihar, India
[2] Indian Inst Technol Kharagpur, Elect & Elect Commun Engn, Kharagpur 721302, W Bengal, India
关键词
CMOS analog circuits; Performance parameter; Pareto-optimal front (PoF); Pareto-optimal point (PoP); Feasibility checking; Topology selection; PERFORMANCE SPACE EXPLORATION; CMOS OP-AMP; GENETIC ALGORITHM; OPTIMIZATION; DESIGN; REGRESSION; SYSTEM;
D O I
10.1007/s10470-017-1073-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, an efficient deterministic methodology for generating Pareto-optimal front (PoF) of analog circuits is proposed. The proposed methodology utilizes modified epsilon constraint method along with geometric programming based circuit sizer to determine the Pareto-optimal points (PoPs) of the analog circuits. The generated PoPs are then modeled to generate the PoFs. The efficiency of the proposed methodology and the accuracy of the generated PoF has been verified with respect to that of the commonly used stochastic approach. It is found that to generate PoF having similar spread, the proposed methodology takes only 20 min whereas the stochastic approach takes 60 h. It also has been observed that the accuracy of the generated PoF using the proposed methodology improved by more than 10% with respect to that of the stochastic approach. The proposed methodology has been implemented to generate the PoF of a two-stage Op-Amp, fully differential folded cascode Op-Amp, fully differential single-stage and two-stage Op-Amps. The generated PoFs have been utilized for (1) feasibility checking for a user given specification of an Op-Amp, (2) performance prediction and (3) topology selection of the analog circuit. As per authors' knowledge, this is the first paper which deals with all the aspects, i.e., generation, modeling and application of the PoF of the analog circuits.
引用
收藏
页码:289 / 316
页数:28
相关论文
共 50 条
  • [1] An efficient method of Pareto-optimal front generation for analog circuits
    Sudip Kundu
    Pradip Mandal
    Analog Integrated Circuits and Signal Processing, 2018, 94 : 289 - 316
  • [2] Efficient multiobjective synthesis of analog circuits using hierarchical pareto-optimal performance hypersurfaces
    Eeckelaert, T
    McConaghy, T
    Gielen, G
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, : 1070 - 1075
  • [3] Efficient generation of pareto-optimal topologies for compliance optimization
    Turevsky, Inna
    Suresh, Krishnan
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2011, 87 (12) : 1207 - 1228
  • [4] GRS method for Pareto-optimal front identification in electromagnetic synthesis
    Farina, M
    Bramanti, A
    Di Barba, P
    IEE PROCEEDINGS-SCIENCE MEASUREMENT AND TECHNOLOGY, 2002, 149 (05) : 207 - 213
  • [5] Efficient generation of large-scale pareto-optimal topologies
    Suresh, Krishnan
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2013, 47 (01) : 49 - 61
  • [6] Efficient generation of large-scale pareto-optimal topologies
    Krishnan Suresh
    Structural and Multidisciplinary Optimization, 2013, 47 : 49 - 61
  • [7] Sensitivity aware NSGA-II based Pareto front generation for the optimal sizing of analog circuits
    Kchaou, O. Bellaaj
    Garbaya, A.
    Kotti, M.
    Pereira, P.
    Fakhfakh, M.
    Fino, M. Helena
    INTEGRATION-THE VLSI JOURNAL, 2016, 55 : 220 - 226
  • [8] Pareto-optimal hardware for digital circuits using SPEA
    Nedjah, N
    Mourelle, LDM
    INNOVATIONS IN APPLIED ARTIFICIAL INTELLIGENCE, 2005, 3533 : 534 - 543
  • [9] Quantified Pareto-optimal Front Comparisons using Attainment Surfaces
    Scheepers, Christiaan
    Engelbrecht, Andries P.
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [10] Obtaining accurate classifiers with Pareto-optimal and near Pareto-optimal rules
    Kuwajima I.
    Nojima Y.
    Ishibuchi H.
    Artificial Life and Robotics, 2008, 13 (01) : 315 - 319