2006
DOI: 10.1088/0026-1394/43/4/s19
|View full text |Cite
|
Sign up to set email alerts
|

A Kalman filter clock ensemble algorithm that admits measurement noise

Abstract: This work gives an algorithm for combining the readings of an ensemble of clocks in which noisy pairwise comparisons are admitted. It extends and generalizes a previously published Kalman filter algorithm that is useful only for an ensemble of clocks within the same laboratory. The present algorithm may be useful for an ensemble of clocks distributed among several remote laboratories.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
1

Year Published

2007
2007
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 36 publications
(47 citation statements)
references
References 11 publications
0
46
1
Order By: Relevance
“…Each satellite can thus compute a composite time associated with all time offsets measured in the system. Corresponding algorithms were developed by Brown [10] and Greenhall [11]. Due to the lack of long term stability of the CSL, a time scale based on CSL alone would successively drift.…”
Section: Synchronization and Kepler Time Scalementioning
confidence: 99%
See 1 more Smart Citation
“…Each satellite can thus compute a composite time associated with all time offsets measured in the system. Corresponding algorithms were developed by Brown [10] and Greenhall [11]. Due to the lack of long term stability of the CSL, a time scale based on CSL alone would successively drift.…”
Section: Synchronization and Kepler Time Scalementioning
confidence: 99%
“…The blending of CSL and H-masers leads to an ensemble of clocks with widely varying properties. Greenhall's algorithm [11] is best suited for handling such situations. The resulting Implicit Ensemble Mean (IEM) essentially follows the most stable source at all values of τ , i.e.…”
Section: Synchronization and Kepler Time Scalementioning
confidence: 99%
“…The discrete solution of the SDE, with τ equal to 15 min, is used to simulate the clock types [6][7][8]. Following the assumptions of the Kalman Filter, it can be shown that the process noise matrix () Q  is a simple function of the q's and the filter time spacing  : 3 5 2 4 3 1 2 3 2 3 3 2 4 3 2 2 3 2 3 3 3 2 3 3 3 1 1 1 1 1 3 20 2 8 6 1 1 1 1 () 2 8 3 2 1 1 6 2…”
Section: Simulation Of Three Improved Monitor Station Clocks and Satementioning
confidence: 99%
“…Two composite clock algorithms [7,8] are applied to process the time offset measurements between the control stations and the satellite clocks and to estimate the three states of the satellite and control station clocks with respect to its implicitly defined time scales. Since N clocks involve maximal N-1 linearly independent measurements, each composite clock algorithm includes a method to prevent the formal covariance of the solution parameters from growing without bound.…”
Section: Composite Clock Algorithms -Brown and Greenhallmentioning
confidence: 99%
“…[9]. For metrology purposes, several algorithms, [10], [11], [8], have been developed to characterize atomic standards and to weight clocks to profitably offset them before combining, in order to have an optimum clock ensemble, [13].…”
Section: Optimum Clock Predictionmentioning
confidence: 99%