MétaCan
Menu
Back to cohort
Record W2800869073 · doi:10.1109/iscas.2018.8351560

Fast Performance Evaluation for Analog Circuit Synthesis Frameworks

2018· article· en· W2800869073 on OpenAlexaff
Zhenxin Zhao, Tuotian Liao, Lihong Zhang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceNetwork topologySchematicAnalogue electronicsGraphElectronic circuitComputer engineeringAlgorithmTopology (electrical circuits)Theoretical computer scienceElectronic engineeringEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

Evaluating the performance of schematic-level un-sized circuits is always a challenging task within the automated analog circuit synthesis process. One has to trade accuracy for efficiency in order to maintain efficient synthesis. This paper presents a new method of fast performance evaluation, which can be applied to general analog circuit synthesis frameworks. We propose to integrate graph-based symbolic analysis with the curve-fitting technique by using the g <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> /l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> methodology. Both linear programming and nonlinear programming are utilized to validate the feasibility of un-sized circuit topology with reference to the defined specifications. Our experimental results indicate high efficacy of the proposed method. It can significantly reduce the entire circuit synthesis time by leaving a small number of circuit topologies for detailed sizing and further evaluation.

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.

How this classification was reachedexpand

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.511

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.027
GPT teacher head0.256
Teacher spread0.229 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations14
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicVLSI and FPGA Design TechniquesFrench-language works237,207