On the Performance of IRS-Assisted Communications with joint Phase Estimation Errors and Discrete Phase Control
Bibliographic record
Abstract
In intelligent reflecting surface (IRS)-assisted communications, the ultimate gain is achieved when the phases of the reflected signals are optimally selected to maximize the signal-to-noise ratio (SNR). However, practical hurdles, particularly the imperfect phase estimation and quantization can reduce the potential gain. Therefore, this work aims at evaluating the impact of applying a quantized phase in the presence of phase estimation errors. Towards this goal, we derive the probability density function (PDF) of the estimated quantized phase, then using the sinusoidal addition theorem (SAT), the PDF of the received signal envelope is derived and used to derive closed-form expressions of the symbol error rate (SER) and outage probability (OP). The obtained analytical and simulation results show that the SER and OP jointly depend on the SNR, phase estimation accuracy, number of IRS elements, and number of quantization levels. The imperfect phase and quantization demonstrated several counterintuitive results. In particular, it is shown that increasing the number of IRS elements or the number of quantization levels may degrade the system performance. Moreover, the results reveal that the impact of phase quantization increases as the phase estimation accuracy decreases. The results also show that the performance is susceptible to phase errors with an even number of reflectors and binary quantization levels.
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.002 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".