Exact Capacity Analysis of Rate Adaptive Power Nonadaptive Multibranch Multihop Decode-and-Forward Relaying Networks
Bibliographic record
Abstract
The capacity of rate adaptive, power nonadaptive, multibranch, multihop, decode-and-forward relaying networks is analyzed for ergodically fading channels. Different cases of superimposed, selection, and orthogonal relaying are investigated. Parallel channel coding and repetition coding are considered for each case. Closed-form expressions for the maximum instantaneous achievable rates are obtained for each case. The distribution functions of the maximum instantaneous achievable rates for a source-relay-symmetric (S-R-sym.), relay-destination-symmetric (R-D-sym.) case are evaluated. The ergodic capacity of rate adaptive, power nonadaptive, multibranch, dual-hop networks in the S-R-sym., R-D-sym. case with no-source-destination-link assumption is derived for Rayleigh fading. It is observed that parallel channel coding gain can attain as much as 1 bit improvement for the examples considered. Increasing the number of branches deteriorates the performance of the orthogonal relaying scheme, but improves the performances of the other schemes albeit with diminishing returns. The performances of all schemes degrade rapidly as the number of hops per branch increases, such that no scheme is more energy efficient than direct transmission for more than three hops per branch.
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.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".