Amplify-and-Forward Multi-Antenna Beamforming with Joint Source-Relay Power Constraint
Bibliographic record
Abstract
In this paper, we consider beamforming (BF) for cooperative networks with one multi-antenna source, multiple multi-antenna amplify-and-forward (AF) relays, and one single-antenna destination. The source BF vector and the AF-BF matrices at the relays are optimized for maximization of the signal-to-noise ratio at the destination under a joint power constraint for the source and the relays. We solve the associated optimization problem in two stages. In the first stage, we find the optimal AF-BF matrices for a given BF vector at the source. In particular, the direction of the AF-BF matrices is derived in closed form and an efficient numerical algorithm for the convex power allocation problem between the source and the relays is provided. In the second stage, the optimal source BF vectors are computed. Thereby, we show that the resulting problem can be transformed into a non-convex polynomial programming problem which allows for an exact solution for small-scale networks. For large-scale networks, we propose efficient suboptimal optimization methods for the source BF vector.
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.001 | 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".