MétaCan
Menu
Back to cohort
Record W1557302094 · doi:10.1109/iscas.2006.1693329

Application of frequency-response masking technique to the design of a novel modified-DFT filter bank

2006· article· en· W1557302094 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
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsFilter bankFilter designRoot-raised-cosine filterFilter (signal processing)Prototype filterComputer scienceMasking (illustration)Electronic engineeringLow-pass filterHigh-pass filterDigital filterControl theory (sociology)EngineeringComputer visionArtificial intelligence

Abstract

fetched live from OpenAlex

Modified-DFT (MDFT) filter banks permit subchannels with linear phase characteristics, and provide high degrees of computational efficiency. However, in MDFT filter banks with subchannels exhibiting narrow transition-bandwidths, the length of the prototype filter becomes prohibitively long, reducing the computational efficiency. It is well known that the frequency-response masking (FRM) technique provides an attractive technique for the realization of digital filters with very narrow transition-bandwidths. In this paper, the FRM digital filter design technique is exploited and applied to the design of a novel cascaded MDFT filter bank realizing selective subchannels with very narrow transition-bandwidths. An application example is given to illustrate the design of the proposed MDFT filter bank. It is shown that the resulting filter bank entails substantially less computational complexity compared to the conventional MDFT filter banks

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: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.683
Threshold uncertainty score0.254

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.000
Open science0.0010.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.039
GPT teacher head0.273
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

Quick stats

Citations8
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207