Subspace-Based Blind Channel Estimation for MIMO-OFDM Systems With Reduced Time Averaging
Bibliographic record
Abstract
Among the various approaches recently proposed for blind estimation of wideband multiple-input-multiple-output (MIMO) wireless channels, subspace-based algorithms are particularly attractive due to their good performance and simple structure. These algorithms primarily exploit the orthogonality of the noise and signal subspaces of the correlation matrix of the received signals to estimate the unknown channel coefficients. In practice, the correlation matrix is unknown and must be estimated through time averaging over multiple received samples. To this end, the unknown channel must remain time invariant through the averaging process, which may pose a serious problem in practical applications. In this paper, to relax this requirement, we propose a novel subspace-based blind channel-estimation algorithm with reduced time averaging, as obtained by exploiting the frequency correlation among adjacent subcarriers in MIMO orthogonal frequency-division multiplexing (OFDM) systems. Simulation results show that the proposed approach outperforms other previously proposed methods within a reasonable averaging time over a Third-Generation Partnership Project (3GPP) spatial channel model.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".