MétaCan
Menu
Back to cohort
Record W2171256801 · doi:10.1109/twc.2009.081187

Performance analysis of soft-bit maximal ratio combining in cooperative relay networks

2009· article· en· W2171256801 on OpenAlexaff
Akram Bin Sediq, Halim Yanıkömeroğlu

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsCarleton University
Fundersnot available
KeywordsMaximal-ratio combiningRelayBit error rateUpper and lower boundsModulation (music)Computer scienceCooperative diversityTopology (electrical circuits)Channel (broadcasting)TelecommunicationsSignal-to-noise ratio (imaging)Diversity combiningAlgorithmAntenna diversityMathematicsFadingWirelessPhysicsCombinatorics

Abstract

fetched live from OpenAlex

In digital cooperative relaying, signals from the source-destination and relay-destination links are combined at the destination to achieve spatial diversity. These signals may not necessarily belong to the same modulation scheme due to the varying channel qualities of the two links. Recently, we have proposed the "soft-bit maximum ratio combiner" (SBMRC) as a low complexity diversity combining scheme for signals with different modulation levels. SBMRC exhibits BER performance that is very close to the optimal maximum likelihood detector (MLD), but with much reduced complexity. In this paper, we revisit SBMRC and provide tight lower bound for the BER performance. Since SBMRC has BER performance slightly inferior to MLD, the derived lower bound can also be used as a good approximation for the BER performance of MLD.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.935
Threshold uncertainty score0.984

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.005
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.001
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.035
GPT teacher head0.281
Teacher spread0.247 · 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

Citations20
Published2009
Admission routes1
Has abstractyes

Explore more

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