Simple and Efficient Double-Talk-Detector for Acoustic Echo Cancellation
Bibliographic record
Abstract
Acoustic Echo Cancellation (AEC) is a topic that has received a great interest in recent years. However, a significant challenge remains with the problem of double-talk especially when the adaptive filter has a fast convergence rate. In this case, the double-talk detector (DTD) must reply in early stage and halt updating of the adaptive filter in order to avoid filter coefficients divergence. Indeed, a complex and inappropriate DTD can seriously affect the convergence rate of the adaptive filter and global performances of the AEC system. In this paper, an implementation of a simple and efficient DTD based on a recursive estimation of the decision variable which is resulting from the level comparison between far-end and microphone signals is proposed. The presented algorithm is then compared with the normalized cross-correlation (NCC) method which is taken as a reference in this work. In the simulation tests, the recursive least squares (RLS) algorithm is used to update the adaptive filter coefficients. The speech signals used in the tests are taken from the TIMIT database.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
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 teacher head, 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".