MétaCan
Menu
Back to cohort
Record W2100337499 · doi:10.1109/icassp.2010.5496021

Comparative evaluation of the dual transform domain echo canceller for DMT-based systems

2010· article· en· W2100337499 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 institutionsMcGill University
Fundersnot available
KeywordsToeplitz matrixComputer scienceEcho (communications protocol)EmulationComputational complexity theoryFrequency domainTransmission (telecommunications)AlgorithmConvergence (economics)Matrix decompositionAdaptive filterDomain (mathematical analysis)MathematicsTelecommunicationsEigenvalues and eigenvectorsComputer vision

Abstract

fetched live from OpenAlex

In DMT-based communication systems where full-duplex transmission is required, digital echo cancellers are employed to cancel echo by means of adaptive filters. In order to reduce the computational complexity of these cancellers, the structure of the Toeplitz matrix containing the transmitted signal is usually exploited to transform the time domain signals and perform the emulation and adaptive update in a more convenient domain (e.g. frequency domain). In this paper, we consider a recently proposed dual transform domain echo canceller, which is based on the general decomposition of the data Toeplitz matrix. A comprehensive comparative performance evaluation of the proposed method with the existing methods is provided. This evaluation includes the comparison of the convergence curves and computational cost of the algorithms. The comparison shows that the proposed canceller achieves a faster convergence with a low error floor with no increase in the complexity.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.734
Threshold uncertainty score0.282

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.043
GPT teacher head0.304
Teacher spread0.261 · 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

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207