MétaCan
Menu
Back to cohort
Record W1870454542 · doi:10.1109/iscas.1990.112147

Design of digital filters using simulated annealing

2002· article· en· W1870454542 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
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsFinite impulse responseSimulated annealingDigital filterTransfer functionFilter designAdaptive simulated annealingLinear filterComputer scienceAlgorithmAnnealing (glass)Electronic engineeringFilter (signal processing)Control theory (sociology)EngineeringMaterials scienceArtificial intelligenceElectrical engineering

Abstract

fetched live from OpenAlex

A simulated annealing optimization algorithm is used in the design of finite impulse response (FIR) filters and fifth-order LDI all-pole digital filters. Using simulated annealing, sin(x)/x precompensating scheme based on both the FIR and LDI structures is presented. The design process begins with a random set of finite precision coefficients for the filter, making no attempt to obtain a good initial starting coefficient. The use of simulated annealing allows the use of nonclassical transfer functions in the design of digital filters, i.e. it allows for the design of arbitrary magnitude response filters.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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

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.002
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.142
GPT teacher head0.286
Teacher spread0.144 · 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

Citations25
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207