MétaCan
Menu
Back to cohort
Record W2097892160 · doi:10.1109/mwscas.2005.1594108

Computationally-efficient methods for blind adaptive equalization

2005· article· en· W2097892160 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
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsBlind equalizationQAMComputer scienceAdaptive equalizerEqualization (audio)DitherEqualizerAlgorithmQuadrature amplitude modulationConstant (computer programming)Bit error rateDecoding methodsTelecommunicationsBandwidth (computing)

Abstract

fetched live from OpenAlex

This paper proposes a new computationally-efficient method for blind equalization and presents a comprehensive review of existing computationally-efficient methods. The proposed method selectively updates the equalizer taps based on the equalizer output radius for QAM signal constellations. Signed-error, dithered signed-error, quantized-error, block, and update-decimated methods are discussed for computationally-efficient blind equalization. The proposed and discussed methods are applied to the constant modulus algorithm (CMA) and multi-modulus algorithm (MMA), and comparisons are provided.

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.001
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.894
Threshold uncertainty score0.322

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.069
GPT teacher head0.417
Teacher spread0.348 · 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

Citations7
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207