MétaCan
Menu
Back to cohort

Error Performance Analysis of BPSK Modulation in Physical-Layer Network-Coded Bidirectional Relay Networks

2010· article· en· W2104878965 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Communications · 2010
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsRelayRelay channelPhase-shift keyingRayleigh fadingLinear network codingBit error rateComputer scienceAlgorithmTopology (electrical circuits)FadingNode (physics)MathematicsDecoding methodsComputer networkNetwork packetEngineeringPhysicsCombinatorics

Abstract

fetched live from OpenAlex

We analyze the error performance of the physical-layer network coding (PNC) protocol without channel coding in bidirectional relay networks for binary phase shift keying (BPSK) over Rayleigh fading channels. It is assumed that a bidirectional relay network consists of two sources and a relay, where each node has a single antenna and operates in a half-duplex mode, and the PNC over finite GF(2) is employed. In this system, since the maximum-likelihood (ML) detection metric of the multiple access channel (MAC) at the relay is given by the sum of two exponential functions, it is not possible to utilize the classical Euclidean distance rule. To make the performance analysis tractable, we approximate the ML detection metric by adopting the max-log approximation. Then we derive tight upper and lower bounds in closed form for the average symbol error probability of the MAC at the relay. Finally, we obtain tight upper and lower bounds in closed form for the end-to-end average bit-error rate (BER).

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.825
Threshold uncertainty score0.806

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.004
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.049
GPT teacher head0.307
Teacher spread0.258 · 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