MétaCan
Menu
Back to cohort
Record W2105358401 · doi:10.1109/vetecf.2009.5378814

Cooperative Power Allocation Schemes and BER Performance in Decode-and-Forward OFCDM Based Relay Networks

2009· article· en· W2105358401 on OpenAlexaff
S. Senthuran, Alagan Anpalagan, Olivia Das

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRelayComputer sciencePower (physics)Node (physics)Topology (electrical circuits)Channel (broadcasting)Computer networkHop (telecommunications)Relay channelElectrical engineeringEngineeringPhysics

Abstract

fetched live from OpenAlex

In this paper, different power allocation schemes between the source and the cooperating relay nodes are analyzed and numerically evaluated for a two-hop decode-and-forward OFCDM based relay network. A cooperative power allocation ratio ¿ (=source power/total power) is defined and BER performance is evaluated for different values of ¿ in the relay network. It is shown that there exists an optimal power allocation ratio for different operating environment such as source-to-relay channel gains and time-frequency spreading factors. It is reported that (a) When all three channels (source-to-relay, source-to-destination and relay-to-destination) have equal gains, power ratio is found to be ¿ ¿ 0.8 (i.e., 80% and 20% of the total power is distributed among source and relay node respectively). The BER performance degrades at a faster rate when ¿ increases above the optimal value than the decrement at higher Eb/N¿. (b) For a network with stronger source-to-relay link, the optimal ¿ remains invariant at higher Eb/N¿for equal channel gain case; however, the optimal power ratio moves toward lower value of ¿ at lower Eb/N¿. (c) The optimal ¿ remains almost the same with different time-frequency spreading factors.

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: Methods · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.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.015
GPT teacher head0.252
Teacher spread0.238 · 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
GenreMethods

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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207