MétaCan
Menu
Back to cohort
Record W2113591233 · doi:10.1109/wcnc.2013.6555221

Multiply-and-forward - A robust transmission scheme for two-way cooperative communication in the presence of nonlinear power amplifier distortion

2013· article· en· W2113591233 on OpenAlexaff
Huai Tan, P. Ho

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsDistortion (music)AmplifierNonlinear distortionRelayBit error rateTransmission (telecommunications)Computer scienceModulation (music)Power (physics)Nonlinear systemSIGNAL (programming language)Electronic engineeringControl theory (sociology)TelecommunicationsMathematicsTopology (electrical circuits)Electrical engineeringEngineeringPhysicsAcousticsDecoding methodsBandwidth (computing)Artificial intelligence

Abstract

fetched live from OpenAlex

We propose in this paper the idea of multiply-and-forward (MF) as a mean to overcome nonlinear power amplifier (NLPA) distortion in two-way cooperative communication systems using MPSK modulation. Compared to amplify-and-forward (AF), of which the relay broadcasts a scaled sum of the signals received from individual sources, the relay in the proposed MF system broadcasts a scaled product of the individually received signals instead. Through signal analysis and simulation, we show that the bit error rate (BER) of the MF protocol is unaffected by NLPA distortion and is able to deliver a second order diversity effect. In contrast, AF exhibits a high irreducible error floor in the presence of NLPA distortion. Actually, MF with an NLPA attains the same BER as AF with a linear power amplifier.

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

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.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
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.040
GPT teacher head0.291
Teacher spread0.252 · 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
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

Citations6
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207