MétaCan
Menu
Back to cohort
Record W2160595327 · doi:10.1109/eit.2009.5189602

Iterative design of IIR variable fractional delay digital filters

2009· article· en· W2160595327 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 Windsor
Fundersnot available
KeywordsInfinite impulse response2D FiltersStability (learning theory)MathematicsControl theory (sociology)Variable (mathematics)Digital filterIterative methodFilter designFilter (signal processing)AlgorithmMathematical optimizationComputer science

Abstract

fetched live from OpenAlex

In this paper, an iterative algorithm is proposed to design IIR variable fraction delay (VFD) digital filters in the weighted least-squares (WLS) sense. The original IIR VFD filter design problem is nonconvex. As an attempt to tackle this difficulty, an iterative procedure is introduced, and the Steiglitz-McBride (SM) reweighting technique is employed at each iteration to transform the original approximation error into a (convex) quadratic form. The stability of designed IIR VFD filters can be ensured by imposing a set of linear stability constraints based on the positive realness. The proposed algorithm can be applied to design IIR VFD filters with either fixed or variable denominator. Two examples are presented to illustrate the effectiveness of the proposed algorithm.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.787
Threshold uncertainty score0.301

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.003
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.029
GPT teacher head0.263
Teacher spread0.234 · 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

Citations6
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207