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] Pareto-Optimal Sustainable Transportation Network Design under Spatial Queuing
    Huang, Wei
    Xu, Guangming
    Lo, Hong K.
    NETWORKS & SPATIAL ECONOMICS, 2020, 20 (03): : 637 - 673
  • [32] The Pareto-optimal temporal aggregation of energy system models
    Hoffmann, Maximilian
    Kotzur, Leander
    Stolten, Detlef
    APPLIED ENERGY, 2022, 315
  • [33] New Tuning Method for PI Controllers based on Pareto-Optimal Criterion with Robustness Constraint
    Leiva, M. C.
    Rojas, J.
    IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (02) : 434 - 440
  • [34] OPSBC: A method to sort Pareto-optimal sets of solutions in multi-objective problems
    Dosantos, Pelayo S.
    Bouchet, Agustina
    Marinas-Collado, Irene
    Montes, Susana
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 250
  • [35] Mining Pareto-optimal modules for delayed product differentiation
    Song, Zhe
    Kusiak, Andrew
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (01) : 123 - 128
  • [36] Pareto-Optimal Clustering with the Primal Deterministic Information Bottleneck
    Tan, Andrew K.
    Tegmark, Max
    Chuang, Isaac L.
    ENTROPY, 2022, 24 (06)
  • [37] DISTRIBUTED PARETO-OPTIMAL SOLUTIONS VIA DIFFUSION ADAPTATION
    Chen, Jianshu
    Sayed, Ali H.
    2012 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2012, : 648 - 651
  • [38] Pareto-optimal workforce scheduling with worker skills and preferences
    Iseri, Ali
    Guner, Hatice
    Guner, Ali Riza
    OPERATIONAL RESEARCH, 2025, 25 (02)
  • [39] A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic
    Behnamian, J.
    Ghomi, S. M. T. Fatemi
    Zandieh, M.
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (08) : 11057 - 11069
  • [40] Context-dependent transformation of Pareto-optimal performance fronts of operational amplifiers
    Roca, Elisenda
    Velasco-Jimenez, Manuel
    Castro-Lopez, Rafael
    Fernandez, Francisco V.
    ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING, 2012, 73 (01) : 65 - 76