MétaCan
Menu
Back to cohort
Record W2539102426 · doi:10.1109/milcom.1990.117406

Acquisition time distribution for Z search strategies in spread spectrum receivers

2002· article· en· W2539102426 on OpenAlexaff
Shuya Pan, D.E. Dodds, S. Kumar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsComputer scienceA priori and a posterioriProbability density functionSpread spectrumFunction (biology)Data acquisitionProcess (computing)AlgorithmSpectrum (functional analysis)Sequence (biology)GaussianTheoretical computer scienceMathematicsStatisticsCode division multiple accessTelecommunicationsPhysics

Abstract

fetched live from OpenAlex

An analysis of the acquisition process for Z serial-search direct-sequence spread spectrum receivers is presented. Using strictly time-domain techniques, equations for the acquisition time probability density function and mean are derived. Probabilities for small acquisition time may be calculated exactly, while larger times require Gaussian approximation to reduce computation time. The analysis brings out the effect of various factors that contribute to acquisition time. The results are suitable for use in the design of receivers which incorporate Z search and utilize a priori information about the code pulse. The method is illustrated by providing acquisition time distribution graphs. The technique known as broken-center/Z search provides the best performance among the various Z strategies.< <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.

How this classification was reachedexpand

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: Empirical · Consensus signal: none
Teacher disagreement score0.969
Threshold uncertainty score0.393

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.033
GPT teacher head0.285
Teacher spread0.252 · 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 teacher head, 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

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207