MétaCan
Menu
Back to cohort
Record W2110961167 · doi:10.1109/icosp.2000.893482

Adaptive beamforming using affine projection algorithms

2002· article· en· W2110961167 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 institutionsCarleton University
Fundersnot available
KeywordsDecorrelationAlgorithmRobustness (evolution)SmoothingRate of convergenceAffine transformationComputer scienceComputational complexity theoryMathematicsConvergence (economics)Adaptive filterMathematical optimizationKey (lock)

Abstract

fetched live from OpenAlex

The dynamic adaptive linear constrained minimum variance (LCMV) beamformer generally uses the normalized LMS (NLMS) algorithm for its robustness and simplicity, but it suffers from a low convergence rate. This paper proposes an alternative beamformer incorporating a simplified fast affine projection (FAP) algorithm, which provides fast convergence speed and low computational complexity. The family of affine projection (AP) algorithms improves its convergence speed significantly due to its decorrelation property. We compare the decorrelation properly of the AP algorithms to that of the spatial smoothing algorithm. The fundamental difference between the two decorrelation properties is clarified.

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.739
Threshold uncertainty score0.571

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.062
GPT teacher head0.244
Teacher spread0.182 · 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

Citations11
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207