MétaCan
Menu
Back to cohort
Record W2111441569 · doi:10.1109/icme.2003.1221047

Affine projection algorithm for oversampled subband adaptive filters

2003· article· en· W2111441569 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
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsAlgorithmAdaptive filterLeast mean squares filterComputational complexity theoryFilter bankRecursive least squares filterComputer scienceFlatness (cosmology)ComputationConvergence (economics)Projection (relational algebra)MathematicsFilter (signal processing)Computer vision

Abstract

fetched live from OpenAlex

The performance of the normalized least mean square (NLMS) algorithm for adaptive filtering is dependent on the spectral flatness of the reference input. Thus, the standard NLMS algorithm does not perform well in over-sampled subband adaptive filters (OS-SAFs) because colored subband signals are generated even for white input signals. Thus we propose the use of the affine projection algorithm (APA) to adapt the individual subband filters in OS-SAP systems. The OS-SAF using APA for adaptation is implemented on a fast, low-resource over-sampled filterbank. Through both theoretical and experimental analyses, it is demonstrated that a low order APA will significantly improve the convergence behavior, offering a low computational complexity compared to the recursive least squares (RLS) method. We employ a recursive method of calculating the correlation matrix to further decrease the computation cost without affecting the performance.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.673
Threshold uncertainty score0.619

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.021
GPT teacher head0.239
Teacher spread0.218 · 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

Citations19
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207