MétaCan
Menu
Back to cohort
Record W2052739893 · doi:10.1049/iet-com.2013.1075

Optimal multi‐input–multi‐output relay transform matrix with a bounded condition number

2014· article· en· W2052739893 on OpenAlexaff
Mohammad Hassan Shariat, Mehrzad Biguesh, Saeed Gazor

Bibliographic record

VenueIET Communications · 2014
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsBounded functionRelayMatrix (chemical analysis)Computer scienceMathematicsCondition numberMathematical optimizationApplied mathematicsEigenvalues and eigenvectorsMathematical analysisPower (physics)

Abstract

fetched live from OpenAlex

A relay communication system where its nodes are equipped with multiple antennas is considered. The relay applies a transformation matrix on its received signal and forwards it to the destination. The authors show that, given a limited relay transmit power, the transformation matrix which maximises the signal‐to‐noise power ratio (SNR) is almost surely a rank‐one matrix. Such a singular transformation matrix prevents accurate channel estimation. As a remedy, they impose a constraint on the condition number (CN) of the relay transformation matrix. They prove that the optimal relay matrix under this new constraint has up to two distinct singular values. Thus, the relay transmits some power in all directions, and this small energy allows better channel estimation. The author's simulation results show that imposing the CN constraint on the relay matrix results in some small loss in the SNR which is quantified in this study; however, the optimal relay matrix enables the receivers to track the channel state information.

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 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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.854
Threshold uncertainty score0.865

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0030.001
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.046
GPT teacher head0.329
Teacher spread0.284 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207