MétaCan
Menu
Back to cohort
Record W2163346639 · doi:10.1109/glocom.2004.1378874

Performance of binary NCFSK with dual-branch S+N selection combining in rician and nakagami-m fading

2005· article· en· W2163346639 on OpenAlexaff
Sasan Haghani, Norman C. Beaulieu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRician fadingNakagami distributionFadingRayleigh fadingIndependent and identically distributed random variablesAlgorithmBit error rateMathematicsSignal-to-noise ratio (imaging)Fading distributionBinary numberComputer sciencePhase-shift keyingSelection (genetic algorithm)TelecommunicationsChannel (broadcasting)StatisticsRandom variableArithmeticArtificial intelligence

Abstract

fetched live from OpenAlex

In traditional selection combining, the branch having the largest signal-to-noise ratio is employed for signal detection. However, many practical systems choose the branch with the largest signal-plus-noise (S+N) at the filter output. Recent work has studied the performance of noncoherent orthogonal frequency shift keying (NCFSK) with S+N selection combining in slow, flat Rayleigh fading channels. We consider the performance of NCFSK with dual-branch S+N selection combining in slow, flat Rician and Nakagami-m fading channels. Two S+N receiver structures for NCFSK are examined and analytical expressions for the bit error rate (BER) performances of these receivers are obtained both for Rician and Nakagami-m fading channels. The channel fadings are assumed to be independent, but not necessarily identically distributed. It is shown that both the S+N receiver structures considered outperform the traditional selection combiner and their performances are compared to the performances of equal gain and square law combiners.

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.001
metaresearch head score (Gemma)0.003
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: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.007
GPT teacher head0.217
Teacher spread0.210 · 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

Citations2
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207