MétaCan
Menu
Back to cohort
Record W2101246173 · doi:10.1109/tcomm.2005.855007

Revised Analyses of Postdetection Switched Combining in Nakagami-<tex>$m$</tex>Fading

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

Bibliographic record

VenueIEEE Transactions on Communications · 2005
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsNakagami distributionFrequency-shift keyingFadingRician fadingMathematicsRayleigh fadingBit error ratePhase-shift keyingStatisticsAlgorithmTelecommunicationsComputer scienceDemodulationDecoding methodsChannel (broadcasting)

Abstract

fetched live from OpenAlex

In two recent papers, the performances of dual-branch postdetection switch-and-stay combining (SSC) for noncoherent orthogonal binary frequency-shift keying (BFSK) and noncoherent orthogonal M-ary frequency-shift keying (MFSK) operating in the presence of slow flat fading modeled by Rayleigh, Nakagami-m, and Rician distributions have been analyzed. In this paper, we show that these previous analyses for the Nakagami-m fading model, which are restricted to integer values of m, are incorrect, and we derive the correct bit-error rate (BER) performances of BFSK and MFSK with dual-branch SSC in Nakagami-m fading for all values of m. Optimum switching thresholds that minimize the BER of BFSK and MFSK with postdetection SSC in Nakagami-m fading are obtained. The performance of postdetection SSC is compared with the performance of predetection SSC, and it is shown that postdetection SSC outperforms predetection SSC for all values of signal-to-noise ratio (SNR). We also show that for a given BER, the performance gain of postdetection SSC over predetection SSC has been overestimated by several decibels in SNR in previous publications.

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.002
metaresearch head score (Gemma)0.006
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.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.048
GPT teacher head0.324
Teacher spread0.276 · 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
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicAdvanced Wireless Communication TechniquesFrench-language works237,207