Performance of Distributed Massive MIMO and Small-Cell Systems Under Hardware and Channel Impairments
Bibliographic record
Abstract
Deploying a large number of distributed access points (AP)s to serve a smaller number of users is one of the promising network architectures for future wireless communication systems. Such network architecture can be operated as a distributed massive multiple-input multiple-output (MIMO) system or as a small-cell (SC) system to satisfy the anticipated high rate requirements for beyond-5G networks. However, in a practical scenario with non-ideal hardware components and high-velocity users, the network experiences an inevitable performance degradation. This paper aims at analyzing the network performance under the operation of distributed massive MIMO and SC systems, taking into account the impairments of real and dynamic systems. Considering multiple-antennas APs, we derive novel closed-form expressions for the downlink (DL) spectral efficiency of both systems. We reveal that limiting the number of served users per AP in distributed massive MIMO systems leads to a corresponding loss in the performance, especially under max-min power control. Besides, despite the SC system provides the largest per-user average DL rate under the deployment of ideal APs, distributed massive MIMO systems become superior in the presence of non-ideal APs. Notably, while increasing the number of deployed non-ideal APs can reduce the introduced loss in distributed massive MIMO systems, this leads to an extra performance loss in SC systems. Finally, we show that the presence of high-velocity users is more harsh in SC systems. In addition, our results show that the SC system operation is more suitable for low-velocity users, however, it is better to operate networks with high velocities users under the distributed massive MIMO systems operation.
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.003 |
| 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.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".