MétaCan
Menu
Back to cohort
Record W1535974995 · doi:10.1109/mwscas.2002.1186842

A recursive approach to the design of linear-phase half-band digital filters having very sharp transition bands

2003· article· en· W1535974995 on OpenAlexaff
N. Li, B. Nowrouzian

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsTransition bandHalf-band filterDigital filterLinear phaseDecimationFilter designComputer sciencem-derived filterFilter (signal processing)Prototype filterDigital delay lineFinite impulse responseMultiplier (economics)Interpolation (computer graphics)AlgorithmElectronic engineeringRoot-raised-cosine filterMathematicsTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Linear-phase FIR digital filters having sharp transition bands find a wide variety of applications in modern digital signal processing. By using conventional design techniques, the resulting FIR digital filters require a large number of multiplier coefficients, making their hardware implementation expensive. This paper presents a recursive approach to the design of linear-phase half-band digital filters having very sharp transition bands. It is shown that by embedding a half-band digital filter between proper decimation and interpolation stages, one can make the filter transition band sharper. In this way, a half-band digital filter having a very sharp transition band can be obtained recursively, by starting from a corresponding half-band digital filter with a gradual transition band. The required sharpness can be achieved by increasing the number of recursions.

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.000
metaresearch head score (Gemma)0.001
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.051
GPT teacher head0.279
Teacher spread0.228 · 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

Citations1
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207