MétaCan
Menu
← Back to cohort
Record W4300503753 · doi:10.48550/arxiv.1608.08142

Maximizing Data Rate for Multiway Relay Channels with Pairwise\n Transmission Strategy

2016· preprint· W4300503753 on OpenAlexaff
Reza Rafie Borujeny, Moslem Noori, Masoud Ardakani

Bibliographic record

VenuearXiv (Cornell University) · 2016
Typepreprint
Language
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsPairwise comparisonPairingRelayComputer scienceTransmission (telecommunications)Pairwise error probabilityChannel (broadcasting)AlgorithmComputer networkTelecommunicationsPower (physics)Artificial intelligence

Abstract

fetched live from OpenAlex

In a multiway relay channel (MWRC), pairwise transmission strategy can be\nused to reduce the computational complexity at the relay and the users without\nsacrificing the data rate, significantly. The performance of such pairwise\nstrategies, however, is affected by the way that the users are paired to\ntransmit. In this paper, we study the effect of pairing on the common rate and\nsum rate of an MWRC with functional-decode-forward (FDF) relaying strategy\nwhere users experience asymmetric channel conditions. To this end, we first\ndevelop a graphical model for an MWRC with pairwise transmission strategy.\nUsing this model, we then find the maximum achievable common rate and sum rate\nas well as the user pairings that achieve these rates. This marks the ultimate\nperformance of FDF relaying in an MWRC setup. Further, we show that the rate\nenhancement achieved through the optimal user pairing becomes less pronounced\nat higher SNRs. Using computer simulations, the performance of the optimal\npairing is compared with those of other proposed pairings in the literature.\n

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.255
GPT teacher head0.244
Teacher spread0.011 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2016
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)→Same topicCooperative Communication and Network Coding→French-language works237,207→