MétaCan
Menu
Back to cohort
Record W2017560290 · doi:10.1541/ieejeiss.123.1735

A Practical Digital Signal Carrier Acquisition based on Kalman Filter Theory

2003· article· en· W2017560290 on OpenAlexaff
Yohdoh Kameo

Bibliographic record

VenueIEEJ Transactions on Electronics Information and Systems · 2003
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsQuest University Canada
Fundersnot available
KeywordsKalman filterCarrier signalComputer scienceControl theory (sociology)SIGNAL (programming language)Root-raised-cosine filterCarrier frequency offsetFilter (signal processing)Fast Kalman filterLinear phaseDigital filterFrequency offsetExtended Kalman filterAmplitudeElectronic engineeringAlgorithmTelecommunicationsBandwidth (computing)PhysicsEngineeringArtificial intelligenceTransmission (telecommunications)Optics

Abstract

fetched live from OpenAlex

Traditionally Extended Kalman Filter has been proposed and studied for the acquisition of a digital carrier signal. However, this technique imposes a heavy load on the processor. And high performances cannot be expected for the poor linearity, in most cases. To overcome these problems, this paper shows that one can use a simple, purely linear Kalman Filter which consists of two states variables - phase and frequency. This new technique selects the carrier phase as the input to the filter, instead of a pair of orthogonal signal amplitudes. The filtering logic is made up of only 4 additions and 2 multiplications. The results of both simulations and experiments show that this filter can acquire the carrier signal within 10 symbols with a probability of 98 % during the initial phase, even when the frequency offset is as large as 20 % of the symbol rate frequency at C/N=6dB. In the steady state, the measured BER is close to the theoretical values. While delivering a similar performance mentioned above, this filter can operate even when the carrier frequency deviates from the expected figure.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.996
Threshold uncertainty score0.707

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.000
Science and technology studies0.0000.000
Scholarly communication0.0010.002
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.012
GPT teacher head0.252
Teacher spread0.240 · 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 designTheoretical or conceptual
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

Citations0
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueIEEJ Transactions on Electronics Information and SystemsSame topicBlind Source Separation TechniquesFrench-language works237,207