Cristian Manolache, Alexandru Caranica, H. Cucu, Andi Buzo, C. Diaconu, G. Pelz
{"title":"Enhanced Candidate Selection Algorithm for Analog Circuit Verification","authors":"Cristian Manolache, Alexandru Caranica, H. Cucu, Andi Buzo, C. Diaconu, G. Pelz","doi":"10.1109/CAS56377.2022.9934364","DOIUrl":null,"url":null,"abstract":"In latest years, the complexity and applicability of modern Integrated Circuits (ICs) grew exponentially, hence the high-pressure to deliver IC designs faster on the market. For safety, a design meeting its specification under any allowed operating condition and fabrication variation is a prerequisite. Therefore, pre-Silicon (pre-Si) analog IC verification is an extremely important task, as in certain regions of this large parameter space, the device exhibits degraded performance, or it fails completely. During verification, a designer must find these regions of the input parameter space where the circuit fails. Ideally this must be done during pre-Si phase, to avoid potential huge re-design delays during prototyping or production. In this context, this paper presents a Machine Learning (ML) approach, where we sample the input space to offer good initial coverage of the operating conditions (OCs) hyperspace, with a small number of simulations. We denote one input of a circuit as an Operating Condition. We then leverage a ML-surrogate model of the circuit instead of time-consuming simulations to propose, during a candidate selection phase, new circuit worst cases, where the circuit fails. After updating the candidate proposal algorithm to include a Gradient Descent (GD) step, we highlight the performance improvement of this new method on synthetic circuits, where we obtain relative absolute verification errors below 1%, while using less simulations than other classical approaches.","PeriodicalId":380138,"journal":{"name":"2022 International Semiconductor Conference (CAS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Semiconductor Conference (CAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAS56377.2022.9934364","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In latest years, the complexity and applicability of modern Integrated Circuits (ICs) grew exponentially, hence the high-pressure to deliver IC designs faster on the market. For safety, a design meeting its specification under any allowed operating condition and fabrication variation is a prerequisite. Therefore, pre-Silicon (pre-Si) analog IC verification is an extremely important task, as in certain regions of this large parameter space, the device exhibits degraded performance, or it fails completely. During verification, a designer must find these regions of the input parameter space where the circuit fails. Ideally this must be done during pre-Si phase, to avoid potential huge re-design delays during prototyping or production. In this context, this paper presents a Machine Learning (ML) approach, where we sample the input space to offer good initial coverage of the operating conditions (OCs) hyperspace, with a small number of simulations. We denote one input of a circuit as an Operating Condition. We then leverage a ML-surrogate model of the circuit instead of time-consuming simulations to propose, during a candidate selection phase, new circuit worst cases, where the circuit fails. After updating the candidate proposal algorithm to include a Gradient Descent (GD) step, we highlight the performance improvement of this new method on synthetic circuits, where we obtain relative absolute verification errors below 1%, while using less simulations than other classical approaches.