Low-Complexity Data-Reuse RLS Algorithm for Stereophonic Acoustic Echo Cancellation
Bibliographic record
Abstract
Stereophonic audio devices employ two loudspeakers and two microphones in order to create a bidirectional sound effect. In this context, the stereophonic acoustic echo cancellation (SAEC) setup requires the estimation of four echo paths, each one corresponding to a loudspeaker-to-microphone pair. The widely linear (WL) model was proposed in recent literature in order to simplify the handling of the SAEC mathematical model. Moreover, low complexity recursive least- squares (RLS) adaptive algorithms were developed within the WL framework and successfully tested for SAEC scenarios. This paper proposes to apply a data-reuse (DR) approach for the combination between the RLS algorithm and the dichotomous coordinate descent (DCD) iterative method. The resulting WL-DR-RLS-DCD algorithm inherits the convergence properties of the RLS family and requires an amount of mathematical operations attractive for practical implementations. Simulation results show that the DR approach improves the tracking capabilities of the RLS-DCD algorithm, with an acceptable surplus in terms of computational workload.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".