MétaCan
Menu
Back to cohort
Record W2742523248 · doi:10.1109/lsp.2017.2735806

Distributed Alamouti Relay Beamforming Scheme in Multiuser Relay Networks

2017· article· en· W2742523248 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Signal Processing Letters · 2017
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsOntario Tech University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRelayBeamformingComputer scienceRelay channelSignal-to-noise ratio (imaging)Transmitter power outputOptimization problemMathematical optimizationPower (physics)AlgorithmMathematicsTelecommunicationsTransmitter

Abstract

fetched live from OpenAlex

We design distributed relay beamforming in a multiuser peer-to-peer relay network. By exploring Alamouti code at both sources and relays, we propose a rank-two Alamouti-based distributed relay beamforming scheme to minimize per relay power, while meeting the signal-to-interference-and-noise ratio targets. For the nonconvex optimization problem, we propose a rank-constrained separable semidefinite relaxation approach to find an approximate solution, and provide conditions for which it produces an optimal solution and a bound on the gap to the optimal performance. Compared with the traditional rank-one distributed relay beamforming scheme, our proposed Alamouti-based rank-two distributed relay beamforming offers a significantly higher likelihood to produce an optimal solution and a better capability to maintain small performance degradation as the network size increases. As a result, it provides substantially improved relay power efficiency.

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.001
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.882
Threshold uncertainty score0.933

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0020.000
Research integrity0.0000.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.034
GPT teacher head0.282
Teacher spread0.249 · 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