MétaCan
Menu
Back to cohort
Record W1961966547 · doi:10.1109/sips.1998.715800

Differential Kalman filtering for tracking Rayleigh fading channels

2002· article· en· W1961966547 on OpenAlex

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
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsKalman filterFast Kalman filterComputer scienceFadingExtended Kalman filterAlpha beta filterInvariant extended Kalman filterControl theory (sociology)EstimatorRecursive least squares filterDifferential (mechanical device)AlgorithmEnsemble Kalman filterChannel (broadcasting)MathematicsAdaptive filterEngineeringTelecommunicationsArtificial intelligenceMoving horizon estimationStatistics

Abstract

fetched live from OpenAlex

The performance of the estimator used in the tracking of a fading channel plays an essential role in many wireless receivers. The conventional Kalman filter is an optimum estimator; however, it is computationally demanding and complex for real-time implementation. A new approach is proposed for the implementation of the Kalman filter based on differential channel states. This leads to a robust differential Kalman filtering algorithm that can be simplified further to ease the implementation without any major loss in performance. It is also shown that the simplifications made to the differential Kalman filter lead to the least mean squares (LMS) algorithm, identifying it as a special case of the Kalman filter.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.892
Threshold uncertainty score0.895

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.046
GPT teacher head0.246
Teacher spread0.201 · 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

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207