Doppler Shift and Channel Estimation for Intelligent Transparent Surface Assisted Communication Systems on High-Speed Railways
Bibliographic record
Abstract
The emerging intelligent transparent surface (ITS), unlike the intelligent reflection surface (IRS), allows incident signals to penetrate it instead of being reflected, which enables the ITS to combat the severe signal penetration loss for high-speed railway (HSR) wireless communications. This paper thus investigates the channel estimation problem where the ITS is attached to the HSR carriage window. We first propose a new transmission scheme with two pilot blocks for each frame. Second, we formulate the channels as functions of physical parameters and thus transform the problem into a parameter recovery problem. Third, we develop a successive closed-form, maximum likelihood (ML) channel estimation algorithm. Specifically, each estimate is expressed as the sum of its perfectly known value and the estimation error. By leveraging the relationship between channels for the two pilot blocks, we eliminate the unknown parameters besides Doppler shifts, which can be thereby recovered. With the reconstructed Doppler-induced phase shifts, we acquire other channel parameters. Moreover, the Cramér-Rao lower bound (CRLB) for each parameter is derived as a performance benchmark. Finally, we provide numerical results to establish the effectiveness of our proposed estimators.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 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".