Subspace-based blind channel estimation : generalization, performance analysis and adaptive implementation
Bibliographic record
Abstract
In this thesis, 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, which can be applied to a multitude of modern digital communication systems. Based on this model, we then 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 performance1 of the proposed estimator, i.e. 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. We also propose a novel adaptive implementation of the generalized subspace channel estimator. The low-complexity and numerical robustness of this adaptive implementation make it suitable for online estimation of time1-varying channels over long observation periods. Finally, we consider the application of the proposed estimator to a down-link CDMA system operating in frequency selective fading channel with negligible ISI. 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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".