MétaCan
Menu
Back to cohort
Record W2059201582 · doi:10.1109/ncc.2012.6176885

Beamforming and combining based on estimated channels in cooperative relay networks

2012· article· en· W2059201582 on OpenAlexaff
MK Arti, Ranjan K. Mallik, Robert Schober

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBeamformingRelayRayleigh fadingMIMOComputer scienceRelay channelChannel (broadcasting)Signal-to-noise ratio (imaging)FadingElectronic engineeringAlgorithmTelecommunicationsEngineeringPhysics

Abstract

fetched live from OpenAlex

In this paper, we study an amplify-and-forward (AF) based multiple-input multiple-output (MIMO) cooperative relay network in which beamforming is done by using estimated channels in a Rayleigh fading environment. A protocol for training of the source, relay and destination is described and methods of channel estimation are proposed. Simulation results show that the trained MIMO relay system based on beamforming outperforms the trained MIMO relay system without beamforming. It is also shown that the performance of the beamforming based MIMO relay system improves with increase in the number of receive antennas at the destination. We analyze the symbol error rate (SER) versus signal-to-noise ratio (SNR) performance of beamforming based AF relaying with perfect channel knowledge at the source, relay, and destination. An expression of the moment generating function (m.g.f.) of the received instantenous SNR at the destination is derived. By using this m.g.f., an exact expression for the SER of M-ary phase-shift keying is obtained.

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 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.944
Threshold uncertainty score0.428

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.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.051
GPT teacher head0.296
Teacher spread0.244 · 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 teacher head, 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

Citations10
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207