MétaCan
Menu
Back to cohort
Record W2100072869 · doi:10.1109/26.855519

The generation of correlated Rayleigh random variates by inverse discrete Fourier transform

2000· article· en· W2100072869 on OpenAlexaff
David James Young, Norman C. Beaulieu

Bibliographic record

VenueIEEE Transactions on Communications · 2000
Typearticle
Languageen
FieldPhysics and Astronomy
TopicScientific Research and Discoveries
Canadian institutionsQueen's University
Fundersnot available
KeywordsRandom variateConvolution random number generatorAlgorithmRandom number generationComputer scienceControl variatesDiscrete Fourier transform (general)Fourier transformInverseMathematicsMathematical optimizationRandom variableStatisticsFourier analysisMonte Carlo methodFractional Fourier transform

Abstract

fetched live from OpenAlex

A number of different algorithms are used for the generation of correlated Rayleigh random variates. This paper presents an analysis of the statistical properties of methods based on the inverse discrete Fourier transform (IDFT). A modification of the algorithm of Smith (1975) is presented, the new method requiring exactly one-half the number of IDPT operations and roughly two-thirds the computer memory of the original method. Evaluations of and comparisons between various variate generation methods using meaningful quantitative measures are believed to be lacking. New quantitative quality measures for random variate generation have been proposed that are, in particular, meaningful and useful for digital communication system simulation. This paper presents the application of these measures to the IDFT method and three other methods of correlated variate generation, comparing the algorithms in terms of the quality of the generated samples and the required computational effort.

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.003
metaresearch head score (Gemma)0.012
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

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

Citations270
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicScientific Research and DiscoveriesFrench-language works237,207