MétaCan
Menu
Back to cohort
Record W1565673794

Single-carrier equalization and distributed beamforming for asynchronous two-way relay networks

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

Bibliographic record

VenueEuropean Signal Processing Conference · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsRelayTransceiverBeamformingComputer scienceChannel (broadcasting)Asynchronous communicationEqualization (audio)Interference (communication)Relay channelIntersymbol interferenceElectronic engineeringPower (physics)TelecommunicationsEngineeringWireless
DOInot available

Abstract

fetched live from OpenAlex

In this paper, we consider a single-carrier communication scheme, where two transceivers exchange information with the help of multiple relays. The propagation delay in each relaying path is assumed to be different from those of the other paths. As such, the end-to-end channel is frequency selective, and hence, it produces inter-symbol-interference (ISI) at the two transceivers. The simple amplify-and-forward scheme is used at the relays and channel equalization is employed at both transceivers to combat ISI. We minimize the mean square error (MSE) of the total estimated received signals at the both transceivers, subject to a total power budget constraint, by optimizing the channel equalizers, the relay beamforming weights, and the transceivers' powers. We show that our proposed approach leads to a relay selection method which transforms the end-to-end channel into a frequency flat channel. We also present a semi-closed-form solution for the optimal relay beamforming weight.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.050
GPT teacher head0.265
Teacher spread0.216 · 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
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

Citations2
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueEuropean Signal Processing ConferenceSame topicCooperative Communication and Network CodingFrench-language works237,207