MétaCan
Menu
← Back to cohort
Record W202972564

Design Optimization Based on Diagnosis Techniques

2000· article· en· W202972564 on OpenAlexaffabout
Andreas Veneris, Magdy S. Abadir, Izzat El Hajj

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldArts and Humanities
TopicHermeneutics and Narrative Identity
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsNetlistLogic optimizationTestabilityComputer engineeringComputer scienceLogic synthesisRegister-transfer levelDigital electronicsPower optimizationVery-large-scale integrationElectronic design automationBoolean functionBenchmark (surveying)Logic gateComputer architectureReliability engineeringPower (physics)AlgorithmEngineeringEmbedded systemElectronic circuitPower consumptionElectrical engineering
DOInot available

Abstract

fetched live from OpenAlex

Logic optimization is the step of the VLSI design cycle where the designer performs modifications on the design obtained to satisfy di#erent constraints such as area, power or delay. In this paper we propose a novel ATPGbased optimization methodology that borrows from previous design error diagnosis and correction techniques. We also present examples and experiments that indicate that our approach has additional potential when compared to previous ATPG/simulation-based optimization methods. Andreas Veneris Magdy S. Abadir Ibrahim N. Hajj University of Toronto Motorola University of Illinois ECE Department 7700 W. Parmer ECE Department and CSL Toronto, ON M5S 3G4 Austin, TX 78729 Urbana, IL 61801 veneris@eecg.toronto.edu m.abadir@motorola.com hajj@uivlsi.csl.uiuc.edu 1 Logic Design Optimization The design of digital circuits usually starts with a behavioral description (specification) coded in some high level description language. At some point of the design cycle, logic synthesi...

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.001

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.040
GPT teacher head0.238
Teacher spread0.198 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
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

Citations0
Published2000
Admission routes2
Has abstractyes

Explore more

Same topicHermeneutics and Narrative Identity→French-language works237,207→