Outage Probability and Optimum Combining for Time Division Broadcast Protocol
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Time division broadcasting (TDBC) is a well-known bidirectional protocol. In this protocol, two sources exchange information with the help of a relay terminal. For amplify-and-forward (AF)-based TDBC, we first derive a tight lower bound of the outage probability in closed-form, and it is very close to the exact outage probability in the whole signal-to-noise ratio (SNR) range irrespective of the values of channel variances. Using the tight lower bound, diversity-multiplexing tradeoff of the TDBC protocol is obtained for finite-SNR. Furthermore, we investigate how to optimize the TDBC protocol; specifically, an optimum method to combine the received signals at the relay terminal is developed. This method minimizes the outage probability and maximizes the total mutual information of the TDBC protocol at the same time.
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.
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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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 it