MétaCan
Menu
Back to cohort
Record W2017547849 · doi:10.1109/icassp.2010.5496052

OFDM amplify-and-forward two-way relaying for MIMO multiuser networks

2010· article· en· W2017547849 on OpenAlexaff
Rui Zhao, Lüxi Yang, Wei‐Ping Zhu, Zhenya He

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsConcordia University
Fundersnot available
KeywordsRelayComputer scienceSubcarrierMIMOUpper and lower boundsBeamformingTransmission (telecommunications)Orthogonal frequency-division multiplexingPrecodingComputer networkSignal-to-noise ratio (imaging)Node (physics)Topology (electrical circuits)Electronic engineeringTelecommunicationsMathematicsChannel (broadcasting)EngineeringElectrical engineering

Abstract

fetched live from OpenAlex

We consider a wireless relay network where two pairs of nodes exchange information with their partners through a single amplify-and-forward two-way relay with each node equipped with multiple antennas. We propose a new relaying scheme employing OFDMA for the multiple access transmission in the first time slot and OFDM/SDMA for the broadcast transmission in the second time slot to improve the sum rate of the network. To fully utilize spatial diversity, we design the relay beamforming matrices according to two methods respectively, i.e., signal to leakage and noise ratio (SLNR) and block diagonalization based zero-forcing (BDZF), on per subcarrier basis. We also derive the upper bound on the capacity region of this two-way relay network by using cut-set theory. Simulation results show that the proposed scheme outperforms three other relaying schemes in terms of sum rate and can approach the upper bound of capacity region.

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.001
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.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.000
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.297
Teacher spread0.265 · 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

Citations3
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207