Low Complexity MIMO Channel Prediction for Fast Time-Variant Vehicular Communications Channels Based on Discrete Prolate Spheroidal Sequences
Bibliographic record
Abstract
Channel state information (CSI) is required at the transmitter for achieving the maximum potentials of multiple-input multiple-output (MIMO) systems. In fast time-variant vehicular communications channels high data rate feedback lines are required in a frequency division duplex (FDD) transceiver for updating the transmitter with the rapidly changing CSI. Even with high data rate feedback lines, the delay caused by channel estimation and feedback may lead to outdated CSI at the transmitter. To reduce both the feedback load and CSI delay, this paper presents a reduced rank autoregressive (AR) channel predictor based on low dimensional discrete prolate spheroidal (DPS) sequences. The new subframe-wise DPS basis expansion model (DPS-BEM) channel predictor properly exploits the channel's restriction to low dimensional subspaces for reducing the prediction error and the computational complexity. The proposed channel predictor can be applied for updating the precoding matrix in time-variant MIMO systems. Simulation results demonstrate that the proposed channel predictor outperforms the DPS based minimum energy (ME) predictor at different Doppler frequencies and has better performance than the conventional Wiener predictor for slower time-variant channels and almost similar performance for very fast time-variant channels with reduced amount of computational complexity.
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.001 |
| 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".