MétaCan
Menu
Back to cohort
Record W2092195795 · doi:10.1109/icccas.2006.284621

State-Space Approaches for Model Reduction of FIR Digital Filters

2006· article· en· W2092195795 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
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsInfinite impulse responseFinite impulse responseDigital filterTruncation (statistics)MathematicsControl theory (sociology)Reduction (mathematics)Impulse response2D FiltersComputationFilter (signal processing)State spaceFilter designModel order reductionAdaptive filterImpulse (physics)AlgorithmApplied mathematicsComputer scienceMathematical analysisStatisticsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we review and compare three state-space methods for approximating a FIR digital filter by a reduced order IIR digital filter. The methods include the impulse-response gramians, the balanced model truncation, and the weighted least-squares approximation. The design steps for each of these methods and their results on three filter examples are presented. Results indicate that the performances of the balanced model truncation and the weighted least-square approximation are similar except the latter requires more computation; and both methods are able to yield better designs than those of the impulse-response gramians

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

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.033
GPT teacher head0.228
Teacher spread0.195 · 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

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicModel Reduction and Neural NetworksFrench-language works237,207