MétaCan
Menu
Back to cohort
Record W2134914860 · doi:10.1109/camsap.2009.5413281

Cooperative amplify-and-forward beamforming with multi-antenna source and relays

2009· article· en· W2134914860 on OpenAlexaff
Yang-wen Liang, Robert Schober

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBeamformingRayleigh fadingRelayComputer scienceSignal-to-noise ratio (imaging)Antenna (radio)Transmission (telecommunications)Node (physics)Maximal-ratio combiningTopology (electrical circuits)FadingElectronic engineeringAlgorithmTelecommunicationsEngineeringDecoding methodsAcousticsPower (physics)PhysicsElectrical engineering

Abstract

fetched live from OpenAlex

In this paper, we propose a beamforming (BF) scheme for cooperative networks with multiple antennas at the source node and the amplify-and-forward (AF) relay nodes. Adopting the instantaneous signal-to-noise ratio (SNR) as optimality criterion, we obtain closed-form expressions for the maximum SNR and the optimal AF-BF matrices at the relays for a given BF vector at the source. Furthermore, we propose a numerical algorithm to find a locally optimal BF vector at the source. Simulation results for Rayleigh fading show that AF-BF with multi-antenna relays can achieve significant performance gains compared to direct transmission without relaying.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.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.0020.001

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.027
GPT teacher head0.262
Teacher spread0.235 · 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