MétaCan
Menu
Back to cohort
Record W2151455170 · doi:10.1109/glocom.1998.775996

First-order Markov modeling for the Rayleigh fading channel

2002· article· en· W2151455170 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsQueen's University
Fundersnot available
KeywordsFadingMarkov chainChannel state informationRayleigh fadingAutocorrelationFading distributionMarkov modelMetric (unit)Markov processComputer scienceVariable-order Markov modelChannel (broadcasting)Statistical physicsAlgorithmMarkov propertyMathematicsStatisticsTelecommunicationsEngineeringPhysicsWireless

Abstract

fetched live from OpenAlex

Previous models for the received signal amplitude of the flat-fading channel that use first-order, finite state, Markov chains are examined. The stochastic properties of a proposed first-order model based on these models are examined. The limitations of using an information theoretic metric, which is sometimes used to justify a first-order Markov chain as a sufficient model for very slowly fading channels, are discussed. A simple method based on qualitatively comparing autocorrelation functions is instead proposed. Contrary to previous reports, the results indicate that first-order Markov chains are not generally suitable for very slowly fading channels. Rather, first-order Markov chains can be suitable for very slowly fading applications which require analysis over only a short duration of time.

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.

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.000
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.939
Threshold uncertainty score0.349

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.021
GPT teacher head0.203
Teacher spread0.182 · 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

Quick stats

Citations35
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Network OptimizationFrench-language works237,207