MétaCan
Menu
Back to cohort
Record W2112125542 · doi:10.1109/isit.2012.6284221

Joint optimization of the transmit covariance and the relay precoder in general Gaussian amplify-and-forward relay channels

2012· article· en· W2112125542 on OpenAlexaff
Ramy H. Gohary, Halim Yanıkömeroğlu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsCarleton University
Fundersnot available
KeywordsRelayKarush–Kuhn–Tucker conditionsCovarianceGaussianComputer scienceOptimization problemControl theory (sociology)Relay channelPrecodingMathematical optimizationMathematicsTopology (electrical circuits)AlgorithmMIMOTelecommunicationsBeamformingStatisticsArtificial intelligencePower (physics)Physics

Abstract

fetched live from OpenAlex

The capacity of the amplify-and-forward (AF) scheme in general full-duplex Gaussian relay channels is achieved by Gaussian codebooks and can be cast as the solution of an optimization problem of the input transmit covariance and the relay precoder. This problem is non-convex. To circumvent this difficulty, the Karush-Kuhn-Tucker (KKT) conditions are used to obtain closed form expressions of the optimal input covariance that corresponds to an arbitrary relay precoder. Using these expressions, it is shown the maximum rate of the AF scheme is achieved by subdiagonal precoders. This observation is used to facilitate the search for the optimal relay precoder, and to show that at high transmit powers, it is optimal for the relay to remain silent and, at low transmit powers, it is optimal to operate in a mode that resembles half-duplex operation.

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.002
metaresearch head score (Gemma)0.005
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.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
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.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.031
GPT teacher head0.247
Teacher spread0.217 · 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
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207