Semiblind Sparse Channel Estimation for MIMO-OFDM Systems
Bibliographic record
Abstract
In this paper, a semiblind algorithm is presented for the estimation of sparse multiple-input-multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) channels. An analysis of the second-order statistics of the signal that was received through a sparse MIMO channel is first conducted, showing that the correlation matrices of the received signal can be expressed in terms of the most significant taps (MSTs) of the sparse channel. This relationship is used to derive a blind constraint for the effective channel vector that corresponds to the MST position. The blind constraint is then combined with the training-based least square criterion to develop a semiblind approach for the estimation of MSTs of the sparse channel. A signal perturbation analysis of the proposed approach is conducted, showing that the new semiblind solution is not subject to the signal perturbation error when the sparse channel is a decimated version of a full finite impulse response channel. Furthermore, the proposed sparse semiblind algorithm has been extended for the estimation of channels in the upsampling domain for MIMO-OFDM systems with pulse shaping. A number of computer-simulation-based experiments for various sparse channels are carried out to confirm the effectiveness of the proposed semiblind approach.
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.000 |
| 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.001 |
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".