MétaCan
Menu
Back to cohort
Record W1965991184 · doi:10.1109/vtcfall.2013.6692260

Joint Relay and Destination Design for Two-Way MIMO AF Multi-Relay Systems

2013· article· en· W1965991184 on OpenAlexaff
Lingling Shen, Youhua Fu, Chen Liu, Wei‐Ping Zhu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsConcordia University
Fundersnot available
KeywordsRelayMIMOPrecodingOptimization problemMathematical optimizationComputer scienceConvex optimizationSingular value decompositionRelay channelGradient descentMean squared errorControl theory (sociology)MathematicsChannel (broadcasting)AlgorithmRegular polygonPower (physics)TelecommunicationsStatistics

Abstract

fetched live from OpenAlex

In this paper, we propose a joint relay and destination optimization design for two-way half-duplex amplify-and-forward (AF) relay systems with multiple relays, each with multiple antennas. By using the sum mean-squared error (MSE) criterion and Wiener filtering principle, the joint relay and destination design is formulated as an optimization problem of the relay precoding matrix under the constraint of total relay transmit power. Then, constructing a virtual point to point MIMO channel and using the singular-value-decomposition (SVD), the optimization problem is simplified to a convex minimization of an upper bound of the sum MSE through a diagonalization process. Finally, a suboptimum scheme is proposed to solve the simplified convex optimization problem. Monte-Carlo simulation shows that the proposed suboptimal scheme gives a better MSE performance than the existing gradient descent algorithm does, and moreover, our method becomes more advantageous when the number of relays or the number of relay antennas increases.

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.002
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.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.108
GPT teacher head0.293
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

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

Citations2
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207