MétaCan
Menu
Back to cohort
Record W2055113639 · doi:10.1109/tit.2014.2310467

Grassmannian Signalling Achieves Tight Bounds on the Ergodic High-SNR Capacity of the Noncoherent MIMO Full-Duplex Relay Channel

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

Bibliographic record

VenueIEEE Transactions on Information Theory · 2014
Typearticle
Languageen
FieldEngineering
TopicFull-Duplex Wireless Communications
Canadian institutionsCarleton University
Fundersnot available
KeywordsRelayTopology (electrical circuits)MIMOUpper and lower boundsRelay channelRayleigh fadingMathematicsErgodic theoryChannel (broadcasting)GrassmannianDecoding methodsFadingChannel capacityTelecommunicationsComputer scienceControl theory (sociology)Power (physics)CombinatoricsMathematical analysisPhysics

Abstract

fetched live from OpenAlex

This paper considers the ergodic noncoherent capacity of a multiple-input multiple-output frequency-flat block Rayleigh fading full duplex relay channel at high signal-to-noise ratios (SNRs). It is shown that, for these SNRs, restricting the input distribution to be isotropic on a compact Grassmann manifold maximizes an upper bound on the cut-set bound. Furthermore, it is shown that, from a degrees of freedom point of view, no relaying is necessary and Grassmannian signalling at the source achieves the upper bound within an SNR-independent gap. When the source-relay channel is sufficiently stronger than the source-destination and relay-destination channels, it is shown that, with the number of relay transmit antennas appropriately chosen, a Grassmannian decode-and-forward scheme, which is devised herein, achieves the ergodic noncoherent capacity of the relay channel within an approximation gap that goes to zero as the SNR goes to infinity. Closed-form expressions for the optimal number of relay transmit antennas indicate that this number decreases monotonically with the source transmit power.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.439
Threshold uncertainty score0.764

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.0000.001
Open science0.0010.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.011
GPT teacher head0.186
Teacher spread0.174 · 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 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

Citations12
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicFull-Duplex Wireless CommunicationsFrench-language works237,207