Uplink-Aided High Mobility Downlink Channel Estimation Over Massive MIMO-OTFS System
Bibliographic record
Abstract
Although it is often used in the orthogonal frequency division multiplexing (OFDM) systems, application of massive multiple-input multiple-output (MIMO) over the orthogonal time frequency space (OTFS) modulation could suffer from enormous training overhead in high mobility scenarios. In this paper, we propose one uplink-aided high mobility downlink channel estimation scheme for the massive MIMO-OTFS networks. Specifically, we firstly formulate the time domain massive MIMO-OTFS signal model along the uplink and adopt the expectation maximization based variational Bayesian (EM-VB) framework to recover the uplink channel parameters including the angle, the delay, the Doppler frequency, and the channel gain for each physical scattering path. Correspondingly, with the help of the fast Bayesian inference, one low complex approach is constructed to overcome the bottleneck of the EM-VB. Then, we fully exploit the angle, delay and Doppler reciprocity between the uplink and the downlink and reconstruct the angles, the delays, and the Doppler frequencies for the downlink massive channels at the base station. Furthermore, we examine the downlink massive MIMO channel estimation over the delay-Doppler-angle domain. The channel dispersion of the OTFS over the delay-Doppler domain is carefully analyzed and is utilized to associate one given path with one specific delay-Doppler grid if different paths of any user have distinguished delay-Doppler signatures. Moreover, when all the paths of any user could be perfectly separated over the angle domain, we design the effective path scheduling algorithm to map different users' data into the orthogonal delay-Doppler-angle domain resource and achieve the parallel and low complex downlink 3D channel estimation. For the general case, we adopt the least square estimator with reduced dimension to capture the downlink delay-Doppler-angle channels. Various numerical examples are presented to confirm the validity and robustness of the proposed scheme.
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.001 | 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.001 | 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".