MétaCan
Menu
Back to cohort
Record W2164767081 · doi:10.1109/glocom.2008.ecp.884

Physical Layer Differential Network Coding for Two-Way Relay Channels

2008· article· en· W2164767081 on OpenAlexaff
Tao Cui, Feifei Gao, Chintha Tellambura

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRelayDifferential codingComputer scienceLinear network codingCoding (social sciences)Physical layerChannel state informationDetectorDifferential (mechanical device)Modulation (music)Decoding methodsChannel (broadcasting)Unitary stateTopology (electrical circuits)Electronic engineeringAlgorithmTelecommunicationsComputer networkMathematicsWirelessPhysicsEngineering

Abstract

fetched live from OpenAlex

In this work, we consider differential modulation in two-way relay channels (TWRC). In single antenna systems, we propose non-coherent schemes for both amplify-and forward (AF) and decode-and-forward (DF) where the channel state information is not required. These new schemes are counterparts of the traditional non-coherent detection in point to point communications. The difficulty with differential modulation design in TWRC is that the received signal is a mixture of the signals from both source terminals. We derive maximum likelihood (ML) detectors for both AF and DF. The DF protocol can be considered as performing differential network coding at the physical layer. In addition, we propose several suboptimal alternatives including decision feedback and prediction based detectors. All these strategies work well as evidenced by simulation results. We also extend the schemes to the multiple-antenna case and provide design criterion of differential unitary space time modulation.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.007

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.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.072
GPT teacher head0.304
Teacher spread0.232 · 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 designTheoretical or conceptual
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

Citations18
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207