MétaCan
Menu
Back to cohort
Record W2126054668 · doi:10.1109/glocom.1990.116582

Improved bounds for timing estimation jitter

2002· article· en· W2126054668 on OpenAlex
Stuart C. White, Norman C. Beaulieu

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
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsQueen's UniversityRaytheon Technologies (Canada)
Fundersnot available
KeywordsUpper and lower boundsJitterSymbol (formal)Synchronization (alternating current)AlgorithmComputer scienceStatement (logic)Signal-to-noise ratio (imaging)Contrast (vision)Noise (video)SIGNAL (programming language)MathematicsCombinatoricsArtificial intelligenceTopology (electrical circuits)TelecommunicationsMathematical analysis

Abstract

fetched live from OpenAlex

Application of a detection theory (DT) bound to the symbol timing recovery problem is developed. It is shown that this bound is particularly well suited to the symbol synchronization problem and provides useful information in a wide variety of situations. The Cramer-Rao (CR) aid DT bounds are compared for this application. In order to fully assess the comparative usefulness of the two bounds, a different form of the CR bound that is more applicable to the symbol timing problem than the usual statement of the CR bound is derived. This modification of the CR bound appears neither to have been suggested nor noted before. It is shown that the DT bound yields useful results for signaling pulses with jump discontinuities and for small signal-to-noise ratios (SNRs). The DT bound provides information about the variation in performance achievable for different symbol sequences. In contrast the CR bound gives no useful information about any of these three cases.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.971
Threshold uncertainty score0.194

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.001
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.043
GPT teacher head0.286
Teacher spread0.243 · 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

Citations6
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207