MétaCan
Menu
Back to cohort
Record W3127061959 · doi:10.1142/s0218126621502078

Improved Design Method for Nearly Linear-Phase IIR Filters Using Constrained Optimization

2021· article· en· W3127061959 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

VenueJournal of Circuits Systems and Computers · 2021
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Victoria
Fundersnot available
Keywords2D FiltersInfinite impulse responseLinear phaseControl theory (sociology)Digital filterSampling (signal processing)Filter (signal processing)Filter designLinear filterMathematicsStability (learning theory)Optimization problemFinite impulse responseMathematical optimizationPrototype filterComputer scienceAlgorithm

Abstract

fetched live from OpenAlex

In this paper, the design of nearly linear-phase recursive digital filters using a constrained optimization method is investigated. The method is based on existing constrained optimization techniques for nearly linear-phase IIR digital filters, and it is expected to be useful in applications where both magnitude and phase response specifications are required to be satisfied. Starting from an initial filter, the proposed method minimizes the group delay deviation under a set of linear constraints in terms of the magnitude response and filter stability. Improved sampling functions are introduced to the optimization problem, which are used to control the sampling points that are used for approximating the group delay and the rest of the constraints in various frequency bands. By using the proposed sampling functions we get an improved IIR filter response.

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.001
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: Methods
Teacher disagreement score0.434
Threshold uncertainty score0.687

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.074
GPT teacher head0.334
Teacher spread0.260 · 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