MétaCan
Menu
Back to cohort
Record W2142891162 · doi:10.1109/vetecf.2003.1285214

Generalized blind subspace channel estimation

2003· article· en· W2142891162 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 institutionsMcGill University
Fundersnot available
KeywordsEstimatorSubspace topologyMean squared errorAlgorithmKernel (algebra)Channel (broadcasting)MathematicsCovarianceSignal subspaceComputer scienceTelecommunications linkMinimum mean square errorCramér–Rao boundMathematical optimizationStatisticsArtificial intelligenceTelecommunicationsCombinatorics

Abstract

fetched live from OpenAlex

We present a systematic study of the subspace-based blind channel estimation method. We first formulate a general signal model of multiple simultaneous signals transmitted through vector channels. Based on this model, we propose a generalized subspace-based channel estimator by minimizing a novel cost function, which incorporates the set of kernel matrices of the signals sharing the target channel via a weighted sum of projection errors. We investigate the asymptotic performance of the proposed estimator - bias, covariance, mean square error (MSE) and Cramer-Rao bound - for large numbers of independent observations. We show that the performance of the estimator can be optimized by increasing the number of kernel matrices and by using a special set of weights in the cost function. Finally, we consider the application of the proposed estimator to a downlink CDMA system. The results of the computer simulations fully support our analytical developments.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.857
Threshold uncertainty score0.280

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.030
GPT teacher head0.288
Teacher spread0.259 · 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
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207