MétaCan
Menu
← Back to cohort
Record W2027767081 · doi:10.1109/vtcfall.2014.6965982

Exploiting Self-Information to Improve the Performance of Multi-Way Relay Channels

2014· article· en· W2027767081 on OpenAlexaff
Shaham Sharifian, Behnam Hashemitabar, T. Aaron Gulliver

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsAdditive white Gaussian noiseQuadrature amplitude modulationRayleigh fadingComputer sciencePrecodingTelecommunications linkRelayThroughputQAMChannel (broadcasting)Transmission (telecommunications)Electronic engineeringFadingComputer networkAlgorithmTelecommunicationsBit error rateWirelessEngineeringMIMOPhysics

Abstract

fetched live from OpenAlex

Full data exchange with complex field network coding (CFNC) has been shown to achieve a throughput of 1/2 symbol per user per channel use (sym/U/CU) in a multiway relay channel (MWRC). Further, optimum precoding has been designed for a MWRC with a throughput of 1/2 sym/U/CU such that a rectangular quadrature amplitude modulation (QAM) constellation symbol is received. To achieve this throughput, any superimposed combination of user symbols must be distinguishable at the relay and users. In this paper, a decode-and-forward (DF) transmission scheme for full data exchange in a MWRC is presented which decreases the constellation size received by the users and hence leads to a downlink performance improvement. This is achieved by exploiting user self-information. It is also shown that the proposed DF transmission scheme leads to uplink performance improvement. The proposed transmission scheme is evaluated in both additive white Gaussian noise (AWGN) and Rayleigh fading channels.

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.001
metaresearch head score (Gemma)0.002
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.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.025
GPT teacher head0.252
Teacher spread0.226 · 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
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→