MétaCan
Menu
Back to cohort
Record W2106971367 · doi:10.1109/vetecf.2007.353

On the Power Allocation for Decode-and-Forward Cooperative Transmission Over Rayleigh-Fading Channels

2007· article· en· W2106971367 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 Vehicular Technology Conference · 2007
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRayleigh fadingComputer scienceBit error rateTransmission (telecommunications)Power (physics)Transmitter power outputFadingConstraint (computer-aided design)Channel (broadcasting)TelecommunicationsComputer networkMathematicsTransmitter

Abstract

fetched live from OpenAlex

As an accompany paper [1], efficient power allocation strategies for cooperative transmission applying decode-and- forward (DF) approach are further investigated in this paper. The cooperative ratio, defined as the ratio of the power used for cooperative-information transmission to the total power, is investigated in an attempt to minimize bit error rate (BER) with a constraint of fixed total transmit power for each user. Our results show that efficient power allocation greatly depends on the cooperative method. The preferred cooperative ratio changes from low to high by using DF with no parity check, amplify-and-forward, DF with parity check. Simulation results show that with appropriate power allocation, BER performance of all cooperative schemes can achieve a significant gain over non-cooperative systems.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
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.030
GPT teacher head0.282
Teacher spread0.252 · 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