MétaCan
Menu
Back to cohort
Record W2588897393 · doi:10.1109/aspdac.2017.7858368

Parasitic-aware GP-based many-objective sizing methodology for analog and RF integrated circuits

2017· article· en· W2588897393 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of CanadaMinistry of Economic Affairs
KeywordsParasitic extractionSizingComputer scienceHeuristicGeometric programmingCMOSElectronic engineeringElectronic circuitAnalogue electronicsProcess (computing)Computer engineeringConvex optimizationRegular polygonComputer architectureEngineeringElectrical engineeringMathematicsArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

In this paper, an efficient parasitic-aware geometric programming and many-objective evolution algorithm based two - phase hybrid sizing methodology is presented. It considers circuit performance constraints and layout parasitics simultaneously within a concurrent process by using convex optimization in the first phase, and knowledge-driven heuristic refinement in the second phase. The proposed method has been used to optimize several analog and RF circuits in different CMOS technologies with high efficacy demonstrated.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.941
Threshold uncertainty score0.605

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.078
GPT teacher head0.325
Teacher spread0.247 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations38
Published2017
Admission routes2
Has abstractyes

Explore more

Same topicVLSI and FPGA Design TechniquesFrench-language works237,207