MétaCan
Menu
Back to cohort

Network Coded Multi-Source Cooperative Communication in BICM-OFDM Networks

2012· article· en· W2042370522 on OpenAlexaff
Toufiqul Islam, Amir Nasri, Robert Schober, Ranjan K. Mallik, Vijay K. Bhargava

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2012
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsPairwise error probabilityComputer scienceOrthogonal frequency-division multiplexingLinear network codingRelayCooperative diversityDiversity gainDecoding methodsAntenna diversityAlgorithmDiversity schemeUpper and lower boundsWireless networkOverhead (engineering)MultiplexingComputer networkChannel (broadcasting)TelecommunicationsWirelessFadingMathematicsPower (physics)

Abstract

fetched live from OpenAlex

In this paper, we study a cooperative diversity scheme for wireless systems employing network coding and the combination of bit-interleaved coded modulation (BICM) and orthogonal frequency division multiplexing (OFDM). The considered system comprises multiple sources, one relay, and one destination. The relay decodes the signal received from all sources and performs network coding before forwarding the signal to the destination. We propose a simple cooperative maximum-ratio combining scheme for the destination which can successfully exploit the full spatial and frequency diversity offered by the channel for arbitrary numbers of sources and arbitrary linear modulation schemes. Furthermore, we propose techniques to reduce the signaling overhead and the decoding complexity at the destination. To gain insight for system design, we derive a closed-form upper bound for the asymptotic worst-case pairwise error probability and the diversity gain of the considered network coded cooperative BICM-OFDM system. These analytical results reveal the influence of various system parameters, including the number of sources, the free distance of the code, and the frequency diversity of the involved links, on performance. Based on the derived analytical results, we develop schemes for optimal relay placement and power allocation. Simulation results corroborate the derived analytical results and confirm the effectiveness of the developed optimization framework.

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 categoriesMeta-epidemiology (narrow), Science and technology studies
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.941
Threshold uncertainty score1.000

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.0020.000
Scholarly communication0.0000.001
Open science0.0040.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.061
GPT teacher head0.301
Teacher spread0.240 · 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.

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

Citations9
Published2012
Admission routes1
Has abstractyes

Explore more

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