MétaCan
Menu
Back to cohort

Transparent Amplify-and-Forward Relaying in MIMO Relay Channels

2010· article· en· W2142445231 on OpenAlexaff
Sami Muhaidat, J.K. Cavers, P. Ho

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2010
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsRelayPairwise error probabilityComputer scienceMIMORelay channelTransmission (telecommunications)Channel state informationCooperative diversityThroughputChannel (broadcasting)Efficient energy useComputer networkWirelessTopology (electrical circuits)TelecommunicationsFadingEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

In this paper, we investigate the performance of a single-relay assisted cooperative link, where the source, relay, and destination terminals are equipped with multiple transmit and receive antennas. We focus on the so-called transparent amplify-and-forward (T-AaF) for MIMO relay channels, in which the relay requires neither channel state information (CSI) nor synchronization of symbols or carrier. Specifically, we propose and analyze new selection schemes, where the relay, based on the received signal energies, selects the "best" received signal on the S → R hop and forwards it to the destination terminal with either repetitive or selective transmission. Through the derivation of pairwise error probability (PEP) expressions and asymptotic order of diversity (AOD) analysis, we demonstrate that the proposed selection schemes preserve full diversity order, while maintaining low complexity implementation, which makes them attractive from a practical point of view. Furthermore, we show that adopting selective transmission on the R → D hop provides better performance, better throughput, and significantly better energy efficiency than repetitive transmission. A Monte Carlo simulation study is also presented to corroborate the analytical results and to provide detailed performance comparisons between the two schemes under consideration.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.930
Threshold uncertainty score0.978

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.0020.000
Research integrity0.0000.002
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.061
GPT teacher head0.305
Teacher spread0.245 · 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

Citations14
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207