MétaCan
Menu
← Back to cohort
Record W2152749206 · doi:10.1109/icc.2011.5962567

Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks

2011· article· en· W2152749206 on OpenAlexaff
Gayan Amarasuriya, Chintha Tellambura, Masoud Ardakani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsHop (telecommunications)RelayCumulative distribution functionMoment-generating functionBeamformingComputer scienceFadingMonte Carlo methodDiversity gainMIMONakagami distributionOutage probabilityProbability density functionBit error rateControl theory (sociology)Array gainTopology (electrical circuits)AlgorithmTelecommunicationsMathematicsChannel (broadcasting)StatisticsAntenna array

Abstract

fetched live from OpenAlex

A comprehensive performance analysis of dual-hop multiple-input multiple-output amplify-forward relay networks with hop-by-hop beamforming is presented. The impact of practical transmission impairments; (i) feedback delays, (ii) channel estimation errors and (iii) spatially-correlated fading on the system performance is studied. Specifically, the amount of performance degradation due to these impairments are quantified analytically and illustrated through numerical results. Numerical results show that these impairments degrade the system performance significantly. The cumulative distribution function of the end-to-end signal-to-noise ratio is derived and used to obtain the moment generating function, the outage probability, and the average symbol error rate (SER) in closed-form. The asymptotic outage probability and average SER are derived to obtain valuable system-design insights such as the diversity order and array gain. Further, our analyses are validated through Monte-Carlo simulations.

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.003
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.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.057
GPT teacher head0.272
Teacher spread0.215 · 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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→