mmWave Doubly-Massive-MIMO Communications Enhanced with an Intelligent Reflecting Surface
Bibliographic record
Abstract
As a means to control wireless propagation environments, the use of emerging and novel intelligent reflecting surfaces (IRS) is envisioned to enhance and broaden many applications in future wireless networks. This paper is concerned with a point-to-point IRS-assisted millimeter-wave (mmWave) system in which the IRS consists of multiple subsurfaces, each having the same number of passive reflecting elements, whereas both the transmitter and receiver are equipped with massive antenna arrays. Under the scenario of having very large numbers of antennas at both transmit and receive ends, the achievable rate of the system is derived. Furthermore, with the objective of maximizing the achievable rate, the paper presents optimal solutions of power allocation, precoding/combining, and IRS's phase shifts. Then it is shown that when the number of reflecting elements at each subsurface is very large, the number of favorable and controllable propagation paths provided by the IRS is simply equal to the number of subsurfaces while the received signal-to-noise ratio corresponding to each of the favorable paths increases quadratically with the number of reflecting elements. In addition, the problem of minimizing the transmit power subject to the rate constraint is analyzed for the scenario without direct paths in the pure LOS propagation. Finally, numerical results are provided to corroborate the obtained analysis.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 |
| Open science | 0.000 | 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".