Design of Multi-User Noncoherent Massive SIMO Systems for Scalable URLLC
Bibliographic record
Abstract
This paper develops and optimizes a non-orthogonal and noncoherent multi-user massive single-input multiple-output (SIMO) framework, with the objective of enabling scalable ultra-reliable low-latency communications (sURLLC) in Beyond-5G (B5G)/6G wireless communication systems. In this framework, the huge diversity gain associated with the large-scale antenna array in the massive SIMO system is leveraged to ensure ultra-high reliability. To reduce the overhead and latency induced by the channel estimation process, we advocate for the noncoherent communication technique, which does not need the knowledge of instantaneous channel state information (CSI) but only relies on large-scale fading coefficients for message decoding. To boost the scalability of noncoherent massive SIMO systems, we enable the non-orthogonal channel access of multiple users by devising a new differential modulation scheme to ensure that each transmitted signal matrix can be uniquely determined in the noise-free case and be reliably estimated in noisy cases when the antenna array size is scaled up. The key idea is to make the transmitted signals from multiple geographically separated users be superimposed properly over the air, such that when the sum signal is correctly detected, the signal sent by each individual user can be uniquely determined. To further enhance the average error performance when the array antenna number is large, we propose a max-min Kullback-Leibler (KL) divergence-based design by jointly optimizing the transmitted powers of all users and the sub-constellation assignments among them. The simulation results show that the proposed design significantly outperforms the existing max-min Euclidean distance-based counterpart in terms of error performance. Moreover, our proposed approach also has a better error performance compared to the conventional coherent zero-forcing (ZF) receiver with orthogonal channel training, particularly for cell-edge users.
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.001 | 0.002 |
| 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.001 |
| 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.001 |
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".