MétaCan
Menu
Back to cohort

Two-Way Amplify-and-Forward Relaying with Gaussian Imperfect Channel Estimations

2012· article· en· W2041176458 on OpenAlexaff
Salama Ikki, Sonia Aı̈ssa

Bibliographic record

VenueIEEE Communications Letters · 2012
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsRelayComputer scienceChannel (broadcasting)GaussianReliability (semiconductor)Upper and lower boundsSignal-to-noise ratio (imaging)Bounded functionImperfectProbability density functionSelection (genetic algorithm)Topology (electrical circuits)AlgorithmTelecommunicationsMathematicsStatisticsPower (physics)

Abstract

fetched live from OpenAlex

In this letter, we study the effect of channel estimation errors on the reception reliability of two-way relaying. For a network with two users that exchange information with each other through multiple amplify-and-forward relays, we investigate a single-relay selection scheme. Since the communication is two-way, the selection scheme aims at optimizing the worse performance of the two communication tasks between the pair of users. The signal-to-noise ratio (SNR) at the users' nodes of the relaying network is formulated and upper bounded. Then, the probability density function (PDF) of the upper bounded SNRs are determined. Subsequently, expressions for the error probabilities are obtained. Furthermore, an approximate PDF of the output instantaneous SNRs are derived, based on which simple and general asymptotic expressions for the error probabilities are presented and discussed. Numerical and simulation results are provided to verify the analysis and compare the performance of the two-way relaying network for different operating conditions and scenarios.

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.004
metaresearch head score (Gemma)0.017
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.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.017
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
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.049
GPT teacher head0.299
Teacher spread0.250 · 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

Citations61
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicCooperative Communication and Network CodingFrench-language works237,207