MétaCan
Menu
Back to cohort

Multi-Carrier Asynchronous Bi-Directional Relay Networks: Joint Subcarrier Power Allocation and Network Beamforming

2013· article· en· W2057026167 on OpenAlexaff
Reza Vahidnia, Shahram Shahbazpanahi

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsSubcarrierRelayComputer scienceBeamformingTransceiverOrthogonal frequency-division multiplexingAsynchronous communicationMultiplexingMultipath propagationElectronic engineeringComputer networkChannel (broadcasting)Power (physics)TelecommunicationsWirelessEngineering

Abstract

fetched live from OpenAlex

We consider an asynchronous bi-directional relay network, consisting of two single-antenna transceivers and multiple single-antenna relays, where the transceiver-relay paths are subject to different relaying and/or propagation delays. Such a network can be viewed as a multipath channel which can cause inter-symbol-interference (ISI) in the signals received by the two transceivers. Hence, we model such a communication scheme as a frequency selective multipath channel which produces ISI at the two transceivers, when the data rates are high. To tackle ISI, the transceivers can employ an orthogonal frequency division multiplexing (OFDM) scheme to diagonalize the end-to-end channel. The relays use simple amplify-and-forward relaying, thereby materializing a distributed beamformer. For such a scheme, we propose two different algorithms, based on the max-min fair design approach, to calculate the subcarrier power loading at the transceivers as well as the relay beamforming weights. We develop computationally efficient solutions to these two approaches. Simulation results are presented to show that our proposed schemes outperform equal or maximum power allocation schemes.

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.002
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.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
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.0020.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.032
GPT teacher head0.261
Teacher spread0.229 · 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

Citations37
Published2013
Admission routes1
Has abstractyes

Explore more

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