MétaCan
Menu
Back to cohort
Record W2155837219 · doi:10.1109/vetecs.2008.521

Multiple-Antenna Multiple-Relay Cooperative Communication System with Beamforming

2008· article· en· W2155837219 on OpenAlexaff
Arash Talebi, Witold A. Krzymień

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
FundersMedical Research Council
KeywordsRelayBeamformingRayleigh fadingMaximal-ratio combiningComputer scienceConstraint (computer-aided design)Antenna (radio)Electronic engineeringPower (physics)Topology (electrical circuits)FadingComputer networkTelecommunicationsMathematicsElectrical engineeringEngineeringPhysicsChannel (broadcasting)

Abstract

fetched live from OpenAlex

In this paper we study the threshold decode and forward (T-DF) fixed relays network with beamforming, which is more reliable than conventional decode and forward (DF) relaying. Deployment of a small number of antennas on fixed relays is easier than on mobile terminals, therefore, the impact of multiple antennas on the outage probability of cooperating fixed relays is considered. Under the total sum power constraint (TSPC) of all relays and also maximum per-relay power constraint (PRPC), the optimum beamforming weights have been found to maximize the received SNR at the destination. It is determined that increasing the number of relays and antennas at each relay increases capacity. The performance of threshold-maximal ratio combining (T-MRC) and threshold-selection combining (T-SC) of the multiple-antenna multiple fixed relays with beamforming is derived. It is observed that the performance of the network with selection combining (SC) configuration is close to the network in which maximal ratio combining (MRC) is used, in addition that it is less complex and less expensive to implement. The outage probability in Rayleigh fading channels is also analyzed.

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.001
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.004

Distilled classifier scores by category (both heads)

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

Citations27
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207