MétaCan
Menu
Back to cohort
Record W2075514383 · doi:10.1109/tcsi.2003.818613

Optimal design of IIR frequency-response-masking filters using second-order cone programming

2003· article· en· W2075514383 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 institutionsUniversity of Victoria
Fundersnot available
KeywordsInfinite impulse responseFinite impulse response2D FiltersDigital filterFrequency responseImpulse responseSecond-order cone programmingLinear filterFilter designRealization (probability)Prototype filterRoundingMasking (illustration)Computer scienceNetwork synthesis filtersControl theory (sociology)MathematicsFilter (signal processing)AlgorithmElectronic engineeringEngineeringConvex optimization

Abstract

fetched live from OpenAlex

The frequency-response-masking (FRM) technique proposed by Lim (1986) has proven effectiveness for the design of very sharp digital filters with reduced implementation complexity compared to other options. In this paper, we propose a constrained optimization method for the design of basic and multistage FRM filters where the prototype filters are of infinite-impulse response (IIR) with prescribed pole radius. The design is accomplished through a sequence of linear updates for the design variables with each update carried out using second-order cone programming. Computer simulations have demonstrated that the class of IIR FRM filters investigated in the paper offers an attractive alternative to its finite-impulse response counterpart in terms of filter performance, system delay, and realization complexity.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.951
Threshold uncertainty score0.688

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.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.047
GPT teacher head0.279
Teacher spread0.232 · 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