Asynchronous Cell-Free Massive MIMO With Rate-Splitting
Bibliographic record
Abstract
In practical cell-free (CF) massive multiple-input multiple-output (MIMO) networks with distributed and low-cost access points, the asynchronous arrival of signals at the user equipments increases multi-user interference that degrades the system performance. Meanwhile, rate-splitting (RS), exploiting the transmission of both common and private messages, has demonstrated to offer considerable spectral efficiency (SE) improvements and its robustness against channel state information (CSI) imperfection. The signal performance of a CF massive MIMO system is first analyzed for asynchronous reception capturing the joint effects of propagation delays and oscillator phases of transceivers. Taking into account the imperfect CSI caused by asynchronous phases and pilot contamination, we derive novel and closed-form downlink SE expressions for characterizing the performance of both the RS-assisted and conventional non-RS-based systems adopting coherent and non-coherent data transmission schemes, respectively. Moreover, we formulate the design of robust precoding for the common messages as an optimization problem that maximizes the minimum individual SE of the common message. To address the non-convexity of the design problem, a bisection method is proposed to solve the problem optimally. Simulation results show that asynchronous reception indeed destroys both the orthogonality of the pilots and the coherent data transmission resulting in poor system performance. Besides, thanks to the uniform coverage properties of CF massive MIMO systems, RS with a simple low-complexity precoding for the common message obtained by the equal ratio sum of the private precoding is able to achieve substantial downlink sum SE gains, while the application of robust precoding to the common message is shown to be useful in some extreme cases, e.g., serious oscillator mismatch and unknown delay phase.
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.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.000 |
| 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".