MétaCan
Menu
Back to cohort

Sum Rate Analysis of Two-Way MIMO AF Relay Networks with Zero-Forcing

2013· article· en· W2064685781 on OpenAlexaff
Gayan Amarasuriya, Chintha Tellambura, Masoud Ardakani

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRayleigh fadingMIMOMathematicsTransmission (telecommunications)RelayAntenna (radio)Monte Carlo methodFadingSignal-to-noise ratio (imaging)Spatial correlationSpatial multiplexingTopology (electrical circuits)AlgorithmTelecommunicationsControl theory (sociology)Computer scienceCombinatoricsStatisticsPhysicsDecoding methodsBeamforming

Abstract

fetched live from OpenAlex

The sum rate of multiple-input multiple-output (MIMO) amplify-and-forward (AF) two-way relay networks (TWRNs) with zero-forcing (ZF) transmission is analyzed. Namely, (1) ZF at the two sources for transmission and reception and (2) ZF at the relay for transmission and reception, are treated. Specifically, the exact sum rate expressions and corresponding high signal-to-noise ratio (SNR) approximations are derived for uncorrelated and min-semi-correlated (i.e., correlation exists only at the minimum antenna terminal) Rayleigh fading cases in closed-form. Moreover, the closed-form upper and lower bounds of the sum rate are derived for max-semi-correlated (i.e., correlation exists only at the maximum antenna terminal) and doubly-correlated Rayleigh fading cases. Notably, these sum rate bounds and high SNR approximations provide valuable insights into practical MIMO AF TWRN system-design and the maximum achievable spatial multiplexing gain. All the analyses are verified by using 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.002
metaresearch head score (Gemma)0.008
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.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.033
GPT teacher head0.274
Teacher spread0.241 · 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

Citations23
Published2013
Admission routes1
Has abstractyes

Explore more

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