MétaCan
Menu
Back to cohort
Record W2095333339 · doi:10.1109/ccece.2008.4564513

An architecture exploration framework for DSP applications

2008· article· en· W2095333339 on OpenAlexafffundvenue
Ahmed Elhossini, Shawki Areibi, R.D. Dony

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Guelph
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDigital signal processingComputer scienceDesign space explorationComputer architectureSystem on a chipSpeedupEmbedded systemArchitectureFrame (networking)Electronic system-level design and verificationDesign methodsComputer engineeringComputer hardwareParallel computingEngineering

Abstract

fetched live from OpenAlex

Advances in chip technology have enabled integrating many functional units on a single chip. This led to the emergence of the concept of system-on-chip (SoC) which is used extensively in the development of advanced embedded systems. Embedded systems are widely used today in different digital signal processing (DSP) applications that usually require high computation power and tight constraints. Using SoC technology increases the challenges facing the designer to choose the optimal design. A tool that helps explore different architectures is required to design an efficient system. In this paper we propose an implementation of an architecture exploration frame-work based on a multi-objective evolutionary algorithm (MOEA) for DSP applications. The design space is based on an experimental core library, and an analytical evaluation approach is used to speedup fitness calculation. Results obtained indicate that the proposed approach is valid and efficient for solving the architecture exploration problem.

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.001
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.007
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0070.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.023
GPT teacher head0.227
Teacher spread0.203 · 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

Citations3
Published2008
Admission routes3
Has abstractyes

Explore more

Same venueConference proceedings - Canadian Conference on Electrical and Computer EngineeringSame topicEvolutionary Algorithms and ApplicationsFrench-language works237,207