Power allocation/beamforming for DF MIMO two-way relaying: Relay and network optimization
Bibliographic record
Abstract
The problem of sum-rate maximization with minimum power consumption is studied for a decode-and-forward (DF) multiple-input multiple-output (MIMO) two-way relaying system consisting of two sources and one relay. Two scenarios are investigated. In the first scenario, the relay optimizes its own power allocation/beamforming strategy given that the strategies of the sources maximize the sum-rate of the multiple-access channel (MAC) phase. In the second scenario, the relay and the sources jointly optimize their power allocation/beamforming strategies over both the MAC and broadcasting (BC) phases. The considered problem of sum-rate maximization with minimum power consumption is shown to be nonconvex in both scenarios. For the first scenario, an algorithm is proposed to find the optimal strategy of the relay. For the second scenario, the sources and the relay find their strategies either through transferring the original nonconvex problem into corresponding convex problems or using a proposed low-complexity algorithm. Simulation results demonstrate the performance of proposed algorithms.
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.001 | 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".