Robust Active and Passive Beamformer Design for IRS-Aided Downlink MISO PS-SWIPT With a Nonlinear Energy Harvesting Model
Bibliographic record
Abstract
This paper optimizes the energy consumption of the downlink of a multiple-antenna base station (BS) transmitting to several single-antenna users. The BS utilizes simultaneous wireless information and power transfer (SWIPT) while receivers apply power-splitting (PS) with a nonlinear energy harvesting model leading to PS-SWIPT. We use an intelligent reflecting surface (IRS) and propose a joint design to optimize the active data and the BS’s energy beamformers, IRS’s passive beamformers, and the receivers’ PS ratios under perfect and imperfect CSI availability. In particular, the total BS transmit power is minimized while guaranteeing a minimum rate and harvested energy for each receiver. We apply the block coordinate descent (BCD) method to optimize active and passive beamformers iteratively. We enforce the rank-one constraint and solve the corresponding optimization problem via successive convex approximation (SCA) for accurate semidefinite relaxations. Furthermore, we propose a worst-case robust design for the imperfect CSI case and reformulate this problem with infinitely many constraints. With the BCD method, the problem is iteratively solved via semidefinite programming (SDP) and a second sub-problem with a linear objective and quadratic matrix inequalities, which is also solved via SCA. Numerical results show significant improvements (e.g., 30% decrease in transmit power) than those of no-IRS and IRS with random phase shifts.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".