MétaCan
Menu
Back to cohort
Record W2086058430 · doi:10.1109/iscas.2013.6572490

New algorithm for minimax design of sparse IIR filters

2013· article· en· W2086058430 on OpenAlexaff
Wu-Sheng Lu, Takao Hinamoto

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsMinimaxInfinite impulse responseComputer scienceFinite impulse responseAlgorithmAlgorithm designMathematical optimizationMathematicsDigital filterFilter (signal processing)

Abstract

fetched live from OpenAlex

Sparse digital filters are of importance as they offer improved implementation efficiency relative to their nonsparse counterparts. This paper examines the design of minimax sparse IIR filters from a sparse representation point of view. The result is a new algorithm that accomplishes a design with three phases - identification of the whereabouts of zero coefficients; optimal design subject to the sparsity constraint; and performance enhancement by further dimension reduction of the working subspace. A design example is presented for illustrating the new algorithm.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.049
GPT teacher head0.283
Teacher spread0.234 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicImage and Signal Denoising MethodsFrench-language works237,207