On the Performance of RIS-Assisted Communications with Direct Link over κ-µ Fading
Bibliographic record
Abstract
Reconfigurable intelligent surfaces (RISs) is a new technology that can be used to create a virtual line-of-sight (LOS) link when the direct link is blocked. The signal-to-noise ratio (SNR) can be significantly improved by optimizing the reflecting elements’ phases to make the reflected signals add coherently at the receiver. Nevertheless, the RIS cannot control the phase of the direct link if it exists. In such scenarios, the RIS phase can still be controlled such that the direct and reflected signals add coherently, however, the gain obtained by using the RIS might be hindered. Therefore, this paper considers the performance analysis of such scenarios where a novel analytical framework is developed to evaluate the SNR, outage probability and bit error rate (BER). To capture a broad range of fading conditions, the channels are modeled as independent but not identically distributed generalized κ - µ shadowed fading channels. The Laguerre expansion is used to derive the probability density function (PDF) and cumulative distribution function (CDF) of the instantaneous channel fading, which are used to derive the PDF and CDF of the instantaneous SNR. The paper also considers deriving the asymptotic PDF, CDF, moment generating function (MGF) of the SNR, as well as the outage probability and BER. The derived expressions are used to evaluate the system performance in various fading environments such as Rayleigh, One-Sided Gaussian, Nakagami- m , Rician, and Rician-shadowed distributions since they are special cases of the κ - µ shadowed distribution. The obtained analytical results corroborated by Monte Carlo simulation show that a strong direct link can generally eliminate the gain obtained using the RIS. Therefore, the overhead required for the RIS operation becomes a burden on the network and may cause severe throughput degradation. In such scenarios, the RIS involvement should dynamically controlled to avoid unnecessary complexity and throughput reduction.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.003 | 0.002 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".