MétaCan
Menu
Back to cohort
Record W2118508180 · doi:10.1109/vtcf.2006.384

ICA-Based Signal Equalization for Digital Receivers

2006· article· en· W2118508180 on OpenAlexaff
Afshin Haghighat

Bibliographic record

VenueIEEE Vehicular Technology Conference · 2006
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsInterDigital (Canada)
Fundersnot available
KeywordsBlind equalizationIndependent component analysisEqualization (audio)Computer scienceSIGNAL (programming language)Blind signal separationSignal processingIntersymbol interferenceQuadrature amplitude modulationElectronic engineeringChannel (broadcasting)Digital signal processingTelecommunicationsArtificial intelligenceEngineeringBit error rate

Abstract

fetched live from OpenAlex

A technique using independent component analysis (ICA) for blind receiver signal processing is investigated. The problem of the receiver signal processing is viewed as of signal equalization and implementation imperfections compensation. Based on this, a model similar to a general ICA problem is developed for the received signal. Then, the use of ICA technique for blind signal equalization in the time domain is presented. The equalization is regarded as a signal separation problem, since the desired signal is separated from interference terms. A common problem using ICA-based techniques is to find a satisfactory number of the mixing signals to populate the mixing matrix. This problem is addressed in the paper by over-sampling of the received signal. By using ICA for equalization, besides channel equalization, other transmission imperfections such as DC bias offset, carrier phase and IQ imbalance will also be corrected. Simulation results for a system using 16-QAM modulation are presented to show the performance of the proposed scheme.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.016
GPT teacher head0.246
Teacher spread0.230 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Vehicular Technology ConferenceSame topicBlind Source Separation TechniquesFrench-language works237,207