MétaCan
Menu
Back to cohort
Record W1995054714 · doi:10.1109/ccece.2014.6901026

Hardware implementation of a real-time genetic algorithm for adaptive filtering applications

2014· article· en· W1995054714 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversité du Québec à Trois-Rivières
Fundersnot available
KeywordsComputer scienceField-programmable gate arrayVHDLRobustness (evolution)Quantization (signal processing)Hardware architectureGenetic algorithmAdaptive filterComputer engineeringAlgorithmComputer hardwareSoftwareMachine learning

Abstract

fetched live from OpenAlex

Genetic algorithms are increasingly being used to address adaptive filtering problems. The interest lies in their ability to find the global solutions for linear and nonlinear problems. However, all the work available in the literature use software implementations running on sequential processors. This work proposes a hardware architecture of a real-time genetic algorithm for adaptive filtering applications. Specifically designed genetic operators are proposed to improve processing performance and robustness to the quantization effect, making low bit-wordlength fixed-point arithmetic implementation possible, which permit hardware cost saving. The proposed architecture is modeled in VHDL and implemented in FPGA using 6-bits wordlength, addressing linear and nonlinear auto regressive moving average (ARMA) model parameters identification problem. The implementation experiments show high signal processing performance and low resources cost.

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.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.794
Threshold uncertainty score0.483

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.013
GPT teacher head0.272
Teacher spread0.259 · 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

Quick stats

Citations5
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207