MétaCan
Menu
Back to cohort
Record W2097695714 · doi:10.1109/isscs.2007.4292680

Multiplierless Evolutionary Filter Design

2007· article· en· W2097695714 on OpenAlexaff
Benoît Châtelain, François Gagnon

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsInfinite impulse responseAdderComputer scienceEvolvable hardware2D FiltersNetwork topologyEvolutionary algorithmDigital filterFilter (signal processing)Genetic algorithmField-programmable gate arrayFinite impulse responseAlgorithmComputer hardwareArtificial intelligence

Abstract

fetched live from OpenAlex

Evolutive algorithms have demonstrated their potential as optimizers in a wide variety of applications. Automated evolutionary design of analog filters, antennas, logical gates and micro-electro-mechanical systems (MEMS) has resulted in unexpected but efficient topologies and configurations. In this paper, we present an automated design procedure for digital filters based on the use of a genetic algorithm (GA) and high level primitives such as delays, bit shift operators and adders. Given the performance criteria, the proposed algorithm autonomously decides on the components use and circuit configuration. Compared to traditional infinite impulse response (IIR) and canonical signed digits (CSD)-IIR filters, synthesis results show that the evolutionary designed (ED) filter can attain a twofold increase in speed and requires less hardware resource.

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.000
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0000.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.027
GPT teacher head0.259
Teacher spread0.232 · 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
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207