MétaCan
Menu
Back to cohort
Record W1984869710 · doi:10.1109/lcomm.2009.091354

Oversampled M-sequences for joint data and bit epoch estimation in DSSS transmissions

2009· article· en· W1984869710 on OpenAlexaff
Daniele Borio

Bibliographic record

VenueIEEE Communications Letters · 2009
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAlgorithmComputer scienceDirect-sequence spread spectrumEstimatorBinary dataPseudorandom binary sequenceBinary numberSpread spectrumSequence (biology)Modulation (music)Transmission (telecommunications)Synchronization (alternating current)MathematicsStatisticsCode division multiple accessTelecommunicationsChannel (broadcasting)Arithmetic

Abstract

fetched live from OpenAlex

The maximum likelihood (ML) estimator for the bit synchronization epoch and data bit values in direct-sequence spread-spectrum (DSSS) transmission consists of determining the binary sequence that maximizes the correlation with the recovered data samples. This requires the exhaustive test of all sequences generated by the different bit combinations and alignments, resulting in a computationally intensive process. In this letter, the properties of maximum length sequences (m-sequences) are exploited for testing all the bit combinations and alignments in parallel, leading to a computationally efficient implementation of the ML estimator. The case where the data bits are modulated by an overlay or secondary code is also considered and the proposed algorithm is generalized to include the effect of this additional modulation.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesOpen science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.959
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0060.001
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.143
GPT teacher head0.373
Teacher spread0.230 · 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.

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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicWireless Communication Networks ResearchFrench-language works237,207