MIMO-OFDM Channel Estimation in the Presence of Frequency Offsets
Bibliographic record
Abstract
Optimal pilot design and placement for channel estimation in multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems with frequency offsets are considered. Both the single-frequency- offset case and the multiple-frequency-offset case are treated. We show that the constant-envelope (CE) condition is sufficient but not necessary for pilot design, and that pilots with multiple envelopes can also achieve the optimal performance in terms of the mean square error (MSE) minimization, provided that an additional constraint on the pilot placement is satisfied simultaneously. New pilot designs, which take into account the multiple-frequency-offset case, are proposed to eliminate inter- pilot-interference (IPI) and to optimize the MSE performance. The least-squares (LS) and linear minimum mean square error (LMMSE) channel estimators for the multiple-frequency- offset case are designed for uncorrelated and correlated MIMO-OFDM channels, respectively. The LMMSE estimator requires the channel covariance matrix. Both optimal adaptive pilot power allocation and suboptimal uniform pilot power allocation are developed for the proposed LMMSE estimator. The adaptive allocation performs 4 dB better than the uniform allocation in the high noise region, but they both perform identically in the low noise region. Performance comparisons are made against several previous pilot designs due to [1], [2]. The proposed LMMSE estimator significantly outperforms the LS estimator.
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.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".