MétaCan
Menu
Back to cohort
Record W2115481960 · doi:10.1109/twc.2009.081642

Amplify-and-forward cooperative OFDM with multiple-relays: performance analysis and relay selection methods

2009· article· en· W2115481960 on OpenAlexaff
Yanwu Ding, Murat Uysal

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSubcarrierOrthogonal frequency-division multiplexingComputer scienceRelayPairwise error probabilityPrecodingAlgorithmSignal-to-noise ratio (imaging)Selection (genetic algorithm)Electronic engineeringChannel (broadcasting)Topology (electrical circuits)TelecommunicationsFadingMathematicsMIMOPower (physics)EngineeringPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we investigate a cooperative system with multiple relays and amplify-and-forward relaying over frequency-selective channels. To extract the available multipath diversity, we employ orthogonal frequency division multiplexing (OFDM) with precoding. Through the derivation of pairwise error probability (PEP), we demonstrate that PEP is not a simple exponential function of the signal-to-noise ratio (SNR), but it includes a term that involves some power of logarithm of the SNR. If that term is ignored, the diversity order is given by the summation of the channel length in the direct link and the minimum of channel lengths in each relaying link confirmed by simulation results. Based on the PEP expression, we also propose two relay selection strategies; one is on a per-subcarrier basis and the other is on an all-subcarrier basis. Our simulation results indicate that both strategies result in performance improvements although the per-subcarrier method performs better.

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.005
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.002
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.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.036
GPT teacher head0.315
Teacher spread0.279 · 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

Citations79
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207