Machine-Learning-Aided TDD Massive MIMO Downlink Transmission for High-Mobility Multi-Antenna Users With Partial Uplink Channel State Information
Bibliographic record
Abstract
Estimation of downlink (DL) channel state information (CSI) is necessary in massive multiple-input multiple-output (MIMO) systems to enable precoding and achieve high spectral efficiency. However, CSI estimation (for both the uplink (UL) and DL) is challenging in an environment with highly-mobile users due to rapidly-varying fading. The estimation becomes even more challenging when UL CSI is incomplete due to system constraints. In this work, we combine two machine learning techniques to tackle the twofold problem of predicting upcoming DL CSI from earlier UL CSI estimates and estimating full UL CSI from its incomplete form. For the first sub-problem, we employ long short-term memory (LSTM) to capture the spatio-temporal correlation between CSI at different time instances and user positions. For the second sub-problem, we use a conditional generative adversarial network (CGAN) to estimate the full UL CSI from varying amounts of incomplete CSI. We examine the normalized mean square error performance of the proposed CGAN-LSTM method and compare the spectral efficiency of the system with what is maximally achievable with complete up-to-date CSI. Furthermore, we extend our machine learning methodology to directly estimate precoding matrices from partial CSI and similarly compare the performance with that achievable using complete up-to-date CSI.
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.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.001 | 0.001 |
| 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".