MétaCan
Menu
Back to cohort
Record W2064513814 · doi:10.1155/2007/12172

Blind Identification of FIR Channels in the Presence of Unknown Noise

2007· article· en· W2064513814 on OpenAlexaff
Xiaojuan He, K.M. Wong

Bibliographic record

VenueEURASIP Journal on Advances in Signal Processing · 2007
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsUpsamplingSubspace topologyComputer scienceNoise (video)Channel (broadcasting)AlgorithmIdentification (biology)Finite impulse responseLinear subspaceDistortion (music)MathematicsArtificial intelligenceTelecommunicationsBandwidth (computing)Image (mathematics)

Abstract

fetched live from OpenAlex

Abstract Blind channel identification techniques based on second-order statistics (SOS) of the received data have been a topic of active research in recent years. Among the most popular is the subspace method (SS) proposed by Moulines et al. (1995). It has good performance when the channel output is corrupted by white noise. However, when the channel noise is correlated and unknown as is often encountered in practice, the performance of the SS method degrades severely. In this paper, we address the problem of estimating FIR channels in the presence of arbitrarily correlated noise whose covariance matrix is unknown. We propose several algorithms according to the different available system resources: (1) when only one receiving antenna is available, by upsampling the output, we develop the maximum a posteriori (MAP) algorithm for which a simple criterion is obtained and an efficient implementation algorithm is developed; (2) when two receiving antennae are available, by upsampling both the outputs and utilizing canonical correlation decomposition (CCD) to obtain the subspaces, we present two algorithms (CCD-SS and CCD-ML) to blindly estimate the channels. Our algorithms perform well in unknown noise environment and outperform existing methods proposed for similar scenarios.

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 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.004
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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.843
Threshold uncertainty score0.319

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0010.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.025
GPT teacher head0.340
Teacher spread0.315 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreEmpirical

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

Citations1
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueEURASIP Journal on Advances in Signal ProcessingSame topicBlind Source Separation TechniquesFrench-language works237,207