MétaCan
Menu
Back to cohort
Record W2108576352 · doi:10.1109/ccece.2007.189

A Hybrid Genetic Algorithm for the Design of IIR Digital Filters

2007· article· en· W2108576352 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 institutionsUniversity of Victoria
Fundersnot available
KeywordsInfinite impulse responseAlgorithmDecimalGenetic algorithm2D FiltersComputer scienceAlgorithm designConvergence (economics)Encoding (memory)Function (biology)Flexibility (engineering)Reliability (semiconductor)Digital filterMathematicsMathematical optimizationFilter (signal processing)Arithmetic

Abstract

fetched live from OpenAlex

A hybrid approach for the design of IIR filters using a genetic algorithm (GA) along with a quasi-Newton (QN) algorithm, referred to hereafter as the GQN algorithm is presented. The algorithm combines the flexibility and reliability inherent in the GA with the fast convergence and precision of the QN algorithm. The GA is used as a global search tool to explore different regions in the parameter space whereas the QN algorithm is used to exploit its efficiency in locating local solutions. The proposed algorithm involves a decimal encoding scheme and the optimization is carried out by minimizing an objective function based on the amplitude response error. Experimental results have shown that the proposed GQN algorithm can consistently achieve IIR filters that would satisfy arbitrary prescribed specifications.

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.940
Threshold uncertainty score0.276

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.018
GPT teacher head0.235
Teacher spread0.217 · 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

Citations3
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207