MétaCan
Menu
Back to cohort
Record W2149568380 · doi:10.1109/icccas.2008.4657888

WLS IIR digial filter design using SOCP

2008· article· en· W2149568380 on OpenAlex
Aimin Jiang, Hon Keung Kwan

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 Windsor
Fundersnot available
KeywordsInfinite impulse responseMathematical optimizationIterative methodMathematicsConvergence (economics)Upper and lower boundsFilter (signal processing)Constraint (computer-aided design)Second-order cone programmingComputer scienceAlgorithmDigital filterConvex optimization

Abstract

fetched live from OpenAlex

In this paper, we propose an iterative method for designing IIR digital filters in the weighted least squares (WLS) sense. Since the original design problem is essentially nonconvex, it is first relaxed into a second-order cone programming (SOCP) problem. By solving the relaxed problem, the lower bound on the optimal value of the original problem can be obtained. And the corresponding filter coefficients can be chosen as the starting point of the following iterative procedure. At each iteration, a linear inequality constraint is further incorporated to gradually reduce the gap between the original and the relaxed problem. Analyses show that the convergence of the proposed iterative procedure can be definitely guaranteed. Two examples are presented to demonstrate the effectiveness of the proposed method.

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.674
Threshold uncertainty score0.326

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.200
GPT teacher head0.296
Teacher spread0.096 · 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

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207