MétaCan
Menu
Back to cohort
Record W2096209374 · doi:10.1109/twc.2008.080071

Using the Bhattacharyya parameter for design and analysis of cooperative wireless systems

2009· article· en· W2096209374 on OpenAlexaff
Josephine P. K. Chu, Raviraj Adve, Andrew W. Eckford

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsYork UniversityUniversity of Toronto
Fundersnot available
KeywordsRelayBhattacharyya distanceComputer scienceSelection (genetic algorithm)Upper and lower boundsWirelessDemodulationMathematical optimizationCode wordTelecommunicationsMathematicsDecoding methodsArtificial intelligence

Abstract

fetched live from OpenAlex

A simplified method of analysis and design based on the Bhattacharyya parameter (BP) in conjunction with the union bound and weight enumeration is presented for relay channels using coded cooperation. This method is particularly suitable for low-complexity relay systems employing demodulate-and-forward, focusing on the problems of relay selection and outage analysis. These applications are chosen to illustrate the use of the BP in scenarios where analytical solutions are otherwise unattainable. In terms of relay selection, it is shown that BP-based relay selection has essentially the same performance as density evolution, though with much lower complexity. It is further shown that BP-based relay selection can be applied to fractional cooperation, where each relay only forwards a fraction of the source codeword. In terms of analysis, it is shown that weight enumeration with BP can be used to provide a close approximate to the upper bound on the outage probability of fractional cooperation, again with much lower computational complexity than density evolution.

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

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.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.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.123
GPT teacher head0.343
Teacher spread0.220 · 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

Citations13
Published2009
Admission routes1
Has abstractyes

Explore more

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