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 条
  • [21] Relation between pareto-optimal fuzzy rules and pareto-optimal fuzzy rule sets
    Ishibuchi, Hisao
    Kuwajima, Isao
    Nojima, Yusuke
    2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION MAKING, 2007, : 42 - +
  • [22] Pareto-Optimal Trace Generation from Declarative Process Models
    Diaz, Juan F.
    Lopez, Hugo A.
    Quesada, Luis
    Rosero, Juan C.
    BUSINESS PROCESS MANAGEMENT WORKSHOPS, BPM 2023, 2024, 492 : 314 - 325
  • [23] Pareto-optimal noncooperative equilibria
    Evtushenko, YG
    Smol'yakov, ER
    DOKLADY AKADEMII NAUK, 1999, 367 (03) : 318 - 320
  • [24] PARETO-OPTIMAL DISCRIMINANT ANALYSIS
    Juefei-Xu, Felix
    Savvides, Marios
    2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 611 - 615
  • [25] PARETO-OPTIMAL TIME ALLOCATION
    KRAUS, M
    ECONOMIC INQUIRY, 1979, 17 (01) : 142 - 145
  • [26] PARETO-OPTIMAL REDISTRIBUTION RECONSIDERED
    BRENNAN, G
    WALSH, C
    PUBLIC FINANCE QUARTERLY, 1973, 1 (02): : 147 - 168
  • [27] Use of pareto-optimal and near pareto-optimal candidate rules in genetic fuzzy rule selection
    Ishibuchi, Hisao
    Kuwajima, Isao
    Nojima, Yusuke
    ANALYSIS AND DESIGN OF INTELLIGENT SYSTEMS USING SOFT COMPUTING TECHNIQUES, 2007, 41 : 387 - +
  • [28] Pareto-optimal methanation catalysts
    Norskov, Jens K.
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2006, 231
  • [29] Pareto-Optimal Cloud Bursting
    Farahabady, Mohammad Reza Hoseiny
    Lee, Young Choon
    Zomaya, Albert Y.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (10) : 2670 - 2682
  • [30] Pareto-optimal Dictionaries for Signatures
    Calonder, Michael
    Lepetit, Vincent
    Fua, Pascal
    2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, : 3011 - 3018