Joint interpolation for LTE downlink channel estimation in very high‐mobility environments with support vector machine regression
Bibliographic record
Abstract
In this study, the estimation of fast‐fading long term evolution (LTE) downlink channels in high‐speed applications of LTE advanced is investigated by the authors. A robust channel estimation and interpolation algorithm is essential in order to adequately track the fast time‐varying channel response. In this contribution, the multipath fast‐fading channel is modelled as a discrete, tapped‐delay and finite impulse response filter. Using support vector machine regression (SVR), they develop an extended algorithm to jointly estimate the complex‐valued channel frequency response in time and frequency domains, in the presence of fading and non‐linear noise from the transmission of known pilot symbols. Furthermore, the channel estimates at the known pilot symbols are interpolated to the unknown data symbols by using the non‐linear SVR approach exploiting kernel features. This study integrates both channel estimation at pilot symbols and interpolation at data symbol into the complex SVR interpolation method. The bit error rate and mean square error performances of the authors’ fast‐fading channel estimation scheme is demonstrated via simulation for LTE downlink with 64‐QAM modulation and 500 km/h velocity under non‐linearities.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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".