MétaCan
Menu
Back to cohort

Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference

2011· article· en· W2138048032 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2011
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsRelayComputer scienceRayleigh fadingGaussian noiseInterference (communication)Noise powerNoise (video)TelecommunicationsWireless networkAntenna diversityCooperative diversityTopology (electrical circuits)Additive white Gaussian noiseFadingWirelessElectronic engineeringChannel (broadcasting)MathematicsAlgorithmPower (physics)EngineeringPhysics

Abstract

fetched live from OpenAlex

Cooperative diversity systems have received significant attention recently as a distributed means of exploiting the inherent spatial diversity of wireless networks. In this paper, we consider a cooperative diversity system consisting of a source, a destination, and multiple single-hop amplify-and-forward relays, and provide a mathematical framework for the asymptotic analysis of this system in generic noise and interference for high signal-to-noise ratios. Assuming independent Rayleigh fading for all links in the network and orthogonal relay-destination channels, we obtain simple and elegant closed-form expressions for the asymptotic symbol and bit error rates valid for arbitrary linear modulation formats, arbitrary numbers of relays, and arbitrary types of noise and interference with finite moments including co-channel interference, ultra-wideband interference, impulsive ε-mixture noise, generalized Gaussian noise, and Gaussian noise. Furthermore, we exploit the derived analytical error rate expressions to develop power allocation, relay selection, and relay placement schemes that are asymptotically optimal in environments with generic noise and interference. In general, the power allocation problem results in a geometric program which can be solved efficiently numerically. For the special case of only one relay, we provide a closed-form result for the optimal power allocation. Simulation results confirm our analysis and illustrate that, in non-Gaussian noise, the proposed power allocation, relay selection, and relay placement schemes lead to large performance gains compared to their conventional counterparts optimized for Gaussian noise.

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.

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.000
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.792
Threshold uncertainty score0.504

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.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.070
GPT teacher head0.256
Teacher spread0.186 · 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