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 条
  • [31] Application of pareto-optimal front as an option to desirability function for the optimization of a microbiological process
    Giordano, Pablo C.
    Pereyra, Virginia
    Beccaria, Alejandro J.
    Vero, Silvana
    Goicoechea, Hector C.
    MICROCHEMICAL JOURNAL, 2020, 155
  • [32] A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
    Behnamian, J.
    Zandieh, M.
    Ghomi, S. M. T. Fatemi
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (17) : 4949 - 4976
  • [33] Privacy preserving decentralized method for computing a pareto-optimal solution
    Sehgal, SK
    Pal, AK
    DISTRIBUTED COMPUTING - IWDC 2005, PROCEEDINGS, 2005, 3741 : 578 - 583
  • [34] Application and Analysis of Methods for Selecting an Optimal Solution from the Pareto-Optimal Front obtained by Multiobjective Optimization
    Wang, Zhiyuan
    Rangaiah, Gade Pandu
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2017, 56 (02) : 560 - 574
  • [35] Improving the visualization of the Pareto-optimal front for the multi-response optimization of chromatographic determinations
    Ortiz, M. C.
    Sarabia, L. A.
    Sanchez, M. S.
    Arroyo, D.
    ANALYTICA CHIMICA ACTA, 2011, 687 (02) : 129 - 136
  • [36] Pareto-optimal Delegation in Customs Unions
    Melatos, Mark
    Woodland, Alan D.
    REVIEW OF INTERNATIONAL ECONOMICS, 2007, 15 (03) : 441 - 461
  • [37] Pareto-Optimal Methods for Gene Ranking
    Alfred O. Hero
    Gilles Fleury
    Journal of VLSI signal processing systems for signal, image and video technology, 2004, 38 : 259 - 275
  • [38] Pareto-optimal alignment of biological sequences
    Roytberg, MA
    Semionenkov, MN
    Tabolina, OY
    BIOFIZIKA, 1999, 44 (04): : 581 - 594
  • [39] A BICRITERION PARETO-OPTIMAL PATH ALGORITHM
    TUNG, CT
    CHEW, KL
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1988, 5 (02) : 166 - 172
  • [40] PARETO-OPTIMAL PROFIT-SHARING
    VANDEBROEK, M
    ASTIN BULLETIN, VOL 18, NO 1, APRIL 1988, 1988, : 47 - 55