Efficient Hybrid Beamforming With Anti-Blockage Design for High-Speed Railway Communications
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Future railway is expected to accommodate both train operation services and passenger broadband services. The millimeter wave (mmWave) communication is a promising technology in providing multi-gigabit data rates to onboard users. However, mmWave communications suffer from severe propagation attenuation and vulnerability to blockage, which can be very challenging in high-speed railway (HSR) scenarios. In this paper, we investigate efficient hybrid beamforming (HBF) design for train-to-ground communications. First, we develop a two-stage HBF algorithm in blockage-free scenarios. In the first stage, the minimum mean square error method is adopted for optimal hybrid beamformer design with low complexity and fast convergence; in the second stage, the orthogonal matching pursuit method is utilized to approximately recover the analog and digital beamformers. Second, in blocked scenarios, we design an anti-blockage scheme by adaptively invoking the proposed HBF algorithm, which can efficiently deal with random blockages. Extensive simulation results are presented to show the sum rate performance of the proposed algorithms under various configurations, including transmission power, velocity of the train, blockage probability, etc. It is demonstrated that the proposed anti-blockage algorithm can improve the effective rate by 20% in severely-blocked scenarios while maintaining low outage probability.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 it