MétaCan
Menu
Back to cohort
Record W1521460635 · doi:10.1109/lascas.2015.7250468

Design of filterbanks using a fast optimization approach

2015· article· en· W1521460635 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 Victoria
Fundersnot available
KeywordsRippleStopbandPassbandFilter bankMinificationElliptic filterPrototype filterFilter designControl theory (sociology)Filter (signal processing)Computer scienceQuadratic equationConvex optimizationMathematicsMathematical optimizationBand-pass filterRegular polygonElectronic engineeringEngineering

Abstract

fetched live from OpenAlex

An optimization approach is proposed which can be used to design all types of filter banks. The design problem is formulated as the iterative minimization of two quadratic functions consisting of the perfect reconstruction (PR) condition and the energy in the filters' stopband areas. By relaxing the frequency specifications on the filters' passband areas, the performance indexes are becoming quadratic functions and can be efficiently minimized. This might result in the presence of ripple inside the filter bank, but the output would be ripple-free provided that the PR conditions are satisfied. The performance of the proposed algorithm (available in [14]) is illustrated with four examples indicating that a good filter bank design can be obtained very fast.

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: Methods
Teacher disagreement score0.130
Threshold uncertainty score0.214

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.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.169
GPT teacher head0.294
Teacher spread0.126 · 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

Citations4
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207