MétaCan
Menu
Back to cohort
Record W7132936157

Automated FPGA design, verification and layout

2004· dissertation· W7132936157 on OpenAlexfundno aff
Ian Carlos Kuon

Bibliographic record

VenueTSpace · 2004
Typedissertation
Language
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaCMC Microsystems
KeywordsField-programmable gate arrayProcess (computing)Integrated circuit layoutIC layout editorPage layoutFPGA prototypeDesign layout recordElectronic design automation
DOInot available

Abstract

fetched live from OpenAlex

The design and layout of Field-Programmable Gate Arrays (FPGAs) is a time-consuming process that is currently performed manually. This work investigates two issues faced when automating this task. First, an accurate comparison of layout area between manually and automatically-generated layouts is performed. For the single commercial architecture considered, this work found that the area of an automatically-generated layout is only 36% larger than that needed for a manual layout. The second half of this work focused on the steps needed to implement a complete FPGA using automatic layout tools. New tools that aid the design and verification of an FPGA are presented and an FPGA created with those tools was verified in simulation and then sent for fabrication. This indicates that automatic layout tools can be used to design complete FPGAs in a fraction of the time required for manual design.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

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

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.021
GPT teacher head0.306
Teacher spread0.285 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicVLSI and FPGA Design TechniquesFrench-language works237,207