Deep Learning-based Channel Estimation for Massive MIMO-OTFS Communication Systems
Bibliographic record
Abstract
This paper introduces a deep learning (DL)-enabled framework for channel estimation of high mobility massive multiple-input multiple-output orthogonal time frequency space (MIMO-OTFS) wireless cellular networks. By modulating data in the delay-Doppler domain, OFTS is able to transform a frequency-selective time-varying fading channel into a quasi-time-invariant channel. Employing OTFS can overcome challenges that traditional modulation schemes encounter in high-mobility applications, and consequently can significantly improve the quality of wireless transmission. To realize these benefits, OTFS systems require accurate channel estimation, which becomes challenging as the number of antennas grows. Channel estimation for OTFS is formulated as a sparse signal recovery problem, and is solved by a novel deep network design consisting of the following three convolutional neural networks (CNN): (i) based on spatial features of doubly-selective fading channels, PositionNet is designed to find the indices of non-zero elements (support) in the sparse channel matrix, (ii) PositionNetrthen refines the solution, and (iii) AmplitudeNet obtains the values of the non-zero elements. This approach provides improvement in bit error rate (BER) and normalized mean squared error (NMSE) as well as significant reduction of 80% in computation. Simulation comparisons demonstrate the merits of the proposed approach.
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.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".