MétaCan
Menu
Back to cohort
Record W2159214526 · doi:10.1109/wcnc.2006.1696523

Single-carrier frequency domain equalization for broadband cooperative communications

2006· article· en· W2159214526 on OpenAlexaff
H. Mheidat, Murat Uysal, Naofal Al‐Dhahir

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceRelayFadingChannel (broadcasting)Topology (electrical circuits)AlgorithmInterference (communication)Decoding methodsTelecommunicationsMathematicsCombinatoricsPhysicsPower (physics)

Abstract

fetched live from OpenAlex

In this paper, we investigate single carrier frequency-domain equalization (SC-FDE) for distributed space-time block codes (D-STBC) in a relay-assisted transmission scenario over frequency-selective fading channels. We assume the special case of a single-relay where the source-to-relay (S rarr R), relay-to-destination (R rarr D), and source-to-destination (S rarr D) links experience possibly different channel delay spreads. Assuming perfect power control between R rarr D and S rarr D links and high signal-to-noise ratio for all underlying links, our performance analysis demonstrates that SC-FDE for D-STBC is able to achieve a maximum diversity order of min(L1, L3)+L2+2 where L1, L2and L3are the channel memory lengths for S rarr R, S rarr D, and R rarr D links, respectively. This illustrates that the smaller of the multipath diversity orders experienced in S rarr R and R rarr D links becomes the performance bottleneck for the relaying path. For the special case of a non-fading relaying path where line-of-sight propagation is possible in either one of these underlying links, we demonstrate that the maximum diversity orders of L1+L2+2 and L3+L2+2 are achievable assuming nonfading R rarr D and S rarr R links, respectively. An extensive Monte Carlo simulation study is presented to corroborate the analytical results and to provide detailed performance comparisons among the competing schemes

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.000
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: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.0000.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.062
GPT teacher head0.301
Teacher spread0.238 · 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
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

Citations4
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207