MétaCan
Menu
Back to cohort
Record W2027722481 · doi:10.1109/tcsi.2003.808858

Fast generation of universal maximally flat fir filters

2003· article· en· W2027722481 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 Fundamental Theory and Applications · 2003
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsConcordia University
Fundersnot available
KeywordsMathematicsComputationRecurrence relationCombinatoricsFinite impulse responseBinomial coefficientDiscrete mathematicsArithmeticAlgorithm

Abstract

fetched live from OpenAlex

The relation for impulse response coefficients of Baher's universal maximally flat filters is a threefold summation formula. The summand involves four binomial coefficients whose computation requires an extensive number of additions and multiplications. There are three main parameters that characterize the filters, the order N, the number of zeros K, and the group delay parameter d. With fixed values for these parameters, the total number of additions, multiplications, and divisions required to compute the impulse response coefficients h/sub k/ are of the orders O(N/sup 4/), O(N/sup 5/) and O(N/sup 4/), respectively. We present a recurrence for the computation of h/sub k/ for all possible values of K under fixed values for N and d. The recurrence provides speedups of the orders O(N/sup 2/), O(N/sup 3/) and O(N/sup 2/) for the number of additions, multiplications and divisions, respectively.

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: Empirical · Consensus signal: none
Teacher disagreement score0.975
Threshold uncertainty score0.472

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.038
GPT teacher head0.249
Teacher spread0.211 · 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