MétaCan
Menu
Back to cohort
Record W2156658126 · doi:10.1109/tcsi.2009.2035412

Design Methodology for Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization

2010· article· en· W2156658126 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

VenueIEEE Transactions on Circuits and Systems I Regular Papers · 2010
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsControl theory (sociology)Filter designDigital filterFilter (signal processing)Transfer functionConvergence (economics)Computer scienceAdaptive filterCascadeLinear phaseStability (learning theory)Design methodsNetwork synthesis filtersPrototype filterPolynomialLinear filterMathematical optimizationMathematicsAlgorithmElectronic engineeringEngineeringControl (management)

Abstract

fetched live from OpenAlex

A methodology for the design of recursive digital filters having nearly linear phase response is proposed. The underlying design method is of the direct type whereby the filter is designed as a single unit. The design problem is formulated as a cascade of filter sections where each section is represented by a biquadratic transfer function either in the conventional polynomial form or in the polar form. The design problem is then solved using a constrained Newton's method whereby constraints are used to assure the stability of the filter, to control the step size in order to achieve fast convergence, and to eliminate a real-axis pole-migration problem that often interferes with the design process. Several design examples demonstrate that when compared with filters designed using existing state-of-the-art methods, the proposed methodology yields filters having reduced order and/or improved performance.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.939
Threshold uncertainty score0.810

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.0010.001
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.060
GPT teacher head0.298
Teacher spread0.238 · 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