Broadcast approaches to dual-hop parallel relay networks
Bibliographic record
Abstract
This paper studies the problem of dual-hop transmission from a source to a destination via two parallel full-duplex relays in block Rayleigh fading environment. All nodes in the network are assumed to be oblivious to their forward-channel gains, however, they have perfect information about their backward-channel gains. We also assume a stringent decoding delay constraint of one fading block that makes the definition of ergodic (Shannon) capacity meaningless. Hence, we adopt the broadcast approach to increase the expected-rate received at the destination. The focus of this paper is on simple, efficient, and practical relaying schemes to increase the average achievable rate at the destination. The maximum expected-rate of ON/OFF based amplify-forward relaying is analytically derived. For further performance improvement, a hybrid decode-amplify-forward relaying strategy, adopting the broadcast approach at the source and relays, is proposed and its maximum throughput and expected-rate are presented. Finally, two different upper-bounds, based on the full cooperation between the relays, are obtained. All theoretical results are illustrated by numerical simulations. As it turns out from the numerical results, when the ratio of the relay power to the source power is low, the proposed hybrid decode-amplify-forward relaying scheme meets the obtained upper-bound.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".