Time scale computation system including complete and weighted ensemble definition
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to the system employed and circuitry used with an ensemble of clocks to obtain an ensemble time. More particularly, the present invention relates to an improved algorithm defining ensemble time that can be, for example, implemented with Kalman filters for obtaining an improved estimate of time from an ensemble of clocks. 
     2. Description of the Related Art 
     For a number of years, groups of precision clocks used in combination have provided the &#34;time&#34; in situations in which high precision timekeeping is required. For example, an &#34;official&#34; time for the United States is provided by the atomic time scale at the National Bureau of Standards, the UTC(NBS), which depends upon an ensemble of continuously operating cesium clocks. The time interval known as the &#34;second&#34; has been defined in terms of the cesium atom by the General Conference of Weights and Measures to be the duration of 9,192,631,770 periods of the radiation corresponding to the transition between the two hyperfine levels of the ground state of the cesium-133 atom. Other clocks may be calibrated according to this definition. Thus, while each clock in a group or ensemble of clocks is typically some type of atomic clock, each clock need not be a cesium clock. 
     Even though one such atomic clock alone is theoretically quite accurate, in many applications demanding high accuracy it is preferred that an ensemble of atomic clocks be used to keep time for a number of reasons. Typically, no two identical clocks will keep precisely the identical time. This is due to a number of factors, including differing frequencies, noise, frequency aging, etc. Further, such clocks are not 100% reliable; that is, they are subject to failure. Accordingly, by using an ensemble of clocks in combination, a more precise estimate of the time can be maintained. 
     When an ensemble of clocks is utilized to provide an estimate of time, various techniques may be employed for processing the signals output by the clocks to obtain the &#34;time&#34;. Typically, interclock time comparisons are made to determine the relative time and frequency of each clock. The noise spectrum of each clock is represented by a mathematical model, with noise parameters determined by the behavior of the individual clock. Clock readings are combined based on these comparisons and models to produce the time scale. 
     One technique for processing clock readings involves the use of Kalman filters. Kalman filters have a number of favorable characteristics that lend them to use in timekeeping. Most important of these characteristics are that Kalman filters are minimum squared error estimators and are applicable to dynamic systems. Starting with a physical model for each clock and the definition of an ensemble of clocks, Kalman filters may be used to perform the calculation of the estimated time. 
     Among their capabilities, Kalman filters produce estimates which are optimum in the minimum squared error sense both in steady state and transient condition. Thus, Kalman filters provide the state estimation and forecasting functions necessary for processing data from an ensemble of clocks. The use of actual system dynamics in the estimation process stabilizes the state estimates against occasional large measurement errors, as Kalman filters automatically provide estimates of the errors of each component of the state vector. 
     Of course, the goal in any technique used to process clock outputs is to obtain the most uniform scale of time. Generally, the performance of any such technique depends on the realism of the mathematical models used to describe the clocks of the ensemble and the definition of the time scale. In this regard, previously utilized algorithms have failed to provide a complete definition of ensemble time. That is, such definitions have accounted for time state only. 
     Of importance, prior designers have not fully accounted for the frequency states of member clocks with respect to the ensemble. More particularly, previous algorithms have effectively failed to fully define and employ correlations between the relative states of the clocks with respect to the ensemble. Thus, when a Kalman or any other approach using these definitions has been used, the accuracy of the resulting estimates of clock frequency and estimates of clock parameters has suffered, adversely impacting timekeeping performance. 
     In theory, such deficiencies decrease as the degree of clock identity in an ensemble increases and as the number of clocks in an ensemble increases. However, in practice, the clocks of an ensemble will not be identical, and a finite number of clocks must be used. Typically, each clock in an ensemble performs differently from the others, even if they are all the same type of clock. Therefore, practically speaking, an inadequacy exists in the prior approaches. 
     The deficiencies of prior approaches can be described with reference to signal processing in general. As with any type of signal processing, when a filter does not provide the appropriate filter characteristics, the accuracy of the results from processing will be sub-optimal. In the prior approaches, the ensemble definition was incomplete. Accordingly, the accuracy of the estimates of time resulting from use of the corresponding filters suffered. 
     SUMMARY OF THE INVENTION 
     Accordingly, an object of the present invention is to provide an improved ensemble definition for signal processing. 
     Another object of the present invention is to provide an ensemble definition which accounts for the frequency of member clocks in relation to the ensemble for improved accuracy. 
     An additional object of the present invention is to provide an ensemble definition which accounts for the frequency aging of member clocks in relation to the ensemble for improved accuracy. 
     Yet another object of the present invention is to include clock frequency measurements in ensemble calculations. 
     A further object of the present invention is to increase the accuracy of time and frequency step detection as part of an ensemble calculation. 
     A further object of the present invention is to provide an improved approach for defining an ensemble in which the system noise covariance matrix takes into account correlations between relative states of the clocks with respect to the ensemble. 
     Yet another object of the present invention is to provide an improved approach for defining an ensemble in which the system noise covariance matrix takes into account the continuous nature of clock noise. 
     An additional object of the present invention is to provide an improved ensemble definition that can be employed in Kalman filters utilized with an ensemble of clocks for timekeeping purposes. 
     To achieve the foregoing objects, and in accordance with the purpose of the invention, as broadly described herein, a system for providing an ensemble time comprises an ensemble of oscillators, each of which generates a respective frequency signal, a time measurement circuit for determining time differences between the frequency signals for predetermined pairs of the oscillators, and a processor for calculating ensemble time based on the time and frequency differences and weighted time, weighted frequency, and weighted frequency aging aspects of each of the oscillators. Preferably, the ensemble comprises N oscillators, one of the oscillators serving as a reference oscillator while the remaining N-1 oscillators providing an estimate of the time, frequency and frequency aging states of the reference oscillator with respect to the ensemble. The weighted time, u je  (t+δ), the weighted frequency, y je  (t+δ), and the weighted frequency aging, w je  (t+δ), aspects of the reference oscillator with respect to the ensemble comprise an ensemble definition where ##EQU1## 
     The weights with respect to the time, frequency and frequency aging aspects of the ensemble definition are restricted only such that ##EQU2## 
     The processor can have an associated memory in which the ensemble definition is stored in the form of Kalman filters. The processor processes the time and frequency differences utilizing the Kalman filters to provide the ensemble time. The system is designed so that a user can input new control parameters (including new weights) as desired. 
     Alternatively, the system can comprise an ensemble of oscillators, each of which provides a signal, a time measurement circuit for determining time differences between signals for predetermined pairs of the oscillators, and a processor for providing ensemble time based on the frequency differences and weighted time and weighted frequency aspects of each of the oscillators or weighted time and weighted frequency aging aspects of each of the oscillators. Such systems will still provide improved results with respect to prior approaches. 
    
    
     Other objects and advantages of the present invention will be set forth in part in the description and drawing figure which follow, and will further be apparent to those skilled in the art. 
     BRIEF DESCRIPTION OF THE DRAWING 
     FIG. 1 is a circuit diagram of an implementation of the present invention. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     As discussed previously, one method for processing the output of a plurality of clocks (i.e., oscillators) included in an ensemble is referred to as the Kalman approach. In this Kalman approach, one of the clocks in the ensemble is temporarily designated as the reference clock, with the remaining clocks &#34;aiding&#34; the time provided by the reference clock. Kalman filters provide state estimation and forecasting functions. Generally, Kalman filters are used to model the performance of quartz oscillators and atomic clocks. Kalman filters act as minimum square error state estimators and are applicable to dynamic systems, that is, systems whose state evolves in time. Kalman filters are recursive and therefore have modest data storage requirements. When employed to provide time from an ensemble of clocks, Kalman filters can, of course, only provide estimates that reflect the algorithms which they embody. 
     The novel clock model utilized in the present invention takes into account the time, the frequency, and the frequency aging. The general form of the clock model consists of a series of integrations. The frequency aging is the integral of white noise, and therefore exhibits a random walk. The frequency is the integral of the frequency aging and an added white noise term, allowing for the existence of random walk frequency noise. The time is the integral of the frequency and an added white noise term which produces random walk phase noise, usually called white frequency noise. An unintegrated additive white noise on the phase state produces additive white phase noise. 
     When two clocks are compared, the relative states are the differences between the state vectors of the individual clocks. Hereinbelow, the state vector of a clock i will be referred to as Only the differences between clocks can be measured. In terms of the state vectors, the differences between a clock j and a clock k at time t is denoted by 
     
          x.sub.jk (t)≡ x.sub.j (t)- x.sub.k (t) 
    
     The same approach will be used below to denote the time of a clock with respect to an ensemble. The ensemble is designated by the subscript e. Since ensemble time is a computed quantity, the ensemble is only realizable in terms of its difference from a physical clock. 
     In the present invention, the individual clock state vector is four-dimensional. In prior approaches, the comparable state vector has more typically been a two-dimensional state vector, taking into account only a phase component and a frequency component. In contrast, the present invention utilizes a system model which incorporates the time, the time without white phase noise, the frequency, and the frequency aging into a four-dimensional state vector, such that a four-dimensional state vector x jk  (t) is as follows: ##EQU3## where u(t) is the time of the system at sample (t), x(t) is the time of the system without white phase noise at sample (t), y(t) is the frequency of the system at sample (t), and w(t) is the frequency aging of the system at sample (t). The state vector evolves from time t to time t+δ according to 
     
         x.sub.jk (t+δ)=Φ(δ)x.sub.jk (t)+Γs.sub.jk (t+δ)|t)+Φ(δ)p.sub.jk (t)        (2) 
    
     where Φ(δ) is a 4×4 dimensional state transition matrix, Γs jk  is the plant noise and Γs jk  (t+δ|t) is a four-dimensional vector containing the noise inputs to the system during the time interval from t to t+δ, and p jk  (t) is a four-dimensional vector containing the control inputs made at time t. 
     The 4×4 dimensional state transition matrix Φ(δ) embodies the system model described above. The state transition matrix is assumed to depend on the length of the interval, but not on the origin, such that ##EQU4## 
     The four-dimensional vector Γ(δ)s jk  (t+δ|t) contains the noise input to the system during the interval from t to t+δ, where ##EQU5## and where β jk  (t+δ) is the white time noise input between clocks j and k at time (t+δ), ε jk  (t+δ|t) is the white frequency noise input at time t+δ, η jk  (t+δ|t) is the random walk frequency noise input at time t+δ, and α jk  (t+δ|t) is the random walk frequency aging noise input at time t+δ. Each element of s(t+δ|t) is normally distributed with zero mean and is uncorrelated in time. The four-dimensional vector p(t) contains the control input made at time t. 
     Equation 2 generates a random walk in the elements of the state vector. 
     A single observation z(t) can be described by a measurement equation. Such an equation relative to clocks j and k can take the following form: 
     
         z.sub.jk (t)=H=(t)x.sub.jk (t)+v.sub.jk (t)                (6) 
    
     where H(t) is a 1×4 dimensional measurement matrix and v(t) is the scalar white noise. An observation made at time t is linear-related to the four elements of the state vector (Equation 1) by the 1×4 dimensional measurement matrix H(t) and the scalar white noise v(t). 
     The noise covariance matrix of the measurement noise, R(t), is defined as follows: 
     
         R(t)=E[v.sub.jk (t)v.sub.jk (t).sup.T ]                    (7) 
    
     where E[ ] is an expectation operator and v jk  (t) T  is the transpose of the noise vector. 
     Phase measurements of the clock relative to the reference are described by 
     
         H(t)=(1 0 0 0) and R=σ.sup.2.sub.vxjk.               (8) 
    
     where σ 2   vxjk  is the variance of the phase measurement process. 
     Similarly, the frequency measurements are described by 
     
         H(t)=(0 0 1 0) and R=σ.sup.2.sub.vyjk.               (9) 
    
     where σ 2   vyjk  is the variance of the frequency measurement process. 
     Q jk  (t+δ|t) is the covariance matrix of the system (or plant) noise generated during an interval from t to t+δ, and is defined by 
     
         Q.sup.jk (t+δ|t)=E[s.sub.jk (t+δ|t)s.sub.jk (t+δ|t).sup.T ]                            (10) 
    
     The system covariance matrix can be expressed in terms of the spectral densities of the noises such that ##EQU6## where f h  is an infinitely sharp high-frequency cutoff. Without this bandwidth limitation, the variance of the white phase additive noise would be infinite. The clock pair spectral densities are the sum of the individual contributions from each of the clocks, 
     
         S.sup.jk =S.sup.j +S.sup.k                                 (12) 
    
     where S j  and S k  are the spectral densities of clocks j and k, respectively. 
     An alternative way to write the elements of the plant covariance matrix for a clock pair jk is 
     
         E[β&#39;.sub.jk (t+δ)δ&#39;.sub.jk (t+δ)]=S.sub.β.sup.jk (t)f.sub.h               (13) 
    
     
         E[ε&#39;.sub.jk (t+δ|t)ε&#39;.sub.jk (t+δ|t)]=S.sub.ε.sup.jk (t)δ+S.sub.μ.sup.jk (t)δ.sup.3 /3+ 
    
     
          S.sub.ξ.sup.jk (t)δ.sup.5 /20                    (14) 
    
     
         E[η&#39;.sub.jk (t+δ|t)η&#39;.sub.jk (t+δ|t)]=S.sub.μ.sup.jk (t)δ+S.sub.ξ.sup.jk (t)δ.sup.3 /3                                       (15) 
    
     
         E[α&#39;.sub.jk (t+δ|t)α&#39;.sub.jk (t+δ|t)]=S.sub.ξ.sup.jk (t)δ      (16) 
    
     
         E[β&#39;.sub.jk (t+δ|t)ε&#39;.sub.jk (t+δ|t)]= 0                                (17) 
    
     
         E[β&#39;.sub.jk (t+δ|t)η&#39;.sub.jk (t+δ|t)]=0                                 (18) 
    
     
         E[β&#39;.sub.jk (t+δ|t)α&#39;.sub.jk (t+δ|t)]=0                                 (19) 
    
     
         E[ε&#39;.sub.jk (t+δ|t)η&#39;.sub.jk (t+δ|t)]=S.sub.μ.sup.jk (t)δ.sup.2 /2+S.sub.Γ.sup.jk (t)δ.sup.4 /8               (20) 
    
     
         E[ε&#39;.sub.jk (t+δ|t)α&#39;.sub.jk (t+δ|t)]=S.sub.μ.sup.jk (t)δ.sup.3 /6(21) 
    
     
         E[η&#39;.sub.jk (t+δ|t)α&#39;.sub.jk (t+δ|t)]=S.sub.μ.sup.jk (t)δ.sup.2 /2(22) 
    
     The spectral density of a noise process is the noise power per Hz bandwidth. The integral of the spectral density is the variance of the process. Thus, for a two-sided spectral density of the noise process a, ##EQU7## 
     It is this form of the plant covariance (i.e., Equations 13-22) which will be used to calculate the plant covariance of the reference clock versus the ensemble. 
     As discussed briefly above, one of the clocks in the ensemble is used as a reference and is designated as clock r. The choice of clock r as the reference clock is arbitrary and may be changed computationally. The role of the reference clock r is to provide initial estimates and to be the physical clock whose differences from the ensemble are calculated. Given that the ensemble consists of N clocks, each of the other N-1 clocks is used as an aiding source. That is, each of the remaining clocks provides an independent estimate of the states of clock r with respect to the ensemble. As indicated, these states are time, frequency, and frequency aging. The present invention defines the states of each clock with respect to the ensemble to be the weighted average of these estimates, and the present invention provides a user with full control over the weighting scheme. Given x(t 2  |t 1 ) denotes a forecast of x at time t 2  based on the true state through time t 1 , time, frequency, and frequency aging of a multiple weight ensemble can be defined as follows: ##EQU8## Each new time of a clock j with respect to the ensemble depends only on the prior states of all the clocks with respect to the ensemble and the current clock difference states. The ensemble definition uses the forecasts of the true states from time t to t+δ, that is, 
     
         x(t+δ|t)=Φ(t+δ|t)x(t)    (26) 
    
     where x(t+δ|t) is the forecasted state vector at time (t+δ) based on the true state through time t. No unsupported estimated quantities are involved in the definition. 
     Prior approaches have frequently used relations superficially similar to that found in equation 23 to define ensemble time. However, as the present inventor has found, equation 23 alone does not provide a complete definition of the ensemble time. Since the prior art does not provide a complete definition of the ensemble time, the filters employed in the prior art do not yield the best estimate of ensemble time. The present invention provides a more complete definition of ensemble time based not only on the time equation (equation 23), but also on the frequency and frequency aging relations (equations 24 and 25). 
     As noted above, a i  (t), b i  (t), and c i  (t) represent weights to be chosen for each of the three relations described in equation 23 through 25 for each of the N clocks in the ensemble. The weights may be chosen in any way subject to the restrictions that all of the weights are positive or 0 and the sum of the weights is 1. That is, ##EQU9## The weights may be chosen to optimize the performance (e.g., by heavily weighting a higher quality clock relative to the others) and/or to minimize the risk of disturbance due to any single clock failure. 
     In contrast to the known prior approaches, the present invention provides a time scale algorithm that utilizes more than one weighting factor for each clock. Accordingly, the present invention is actually able to enhance performance at both short and long times even when the ensemble members have wildly different characteristics, such as cesium standards, active hydrogen masers and mercury ion frequency standards. Through algebraic manipulations, the ensemble definition can be written in a form which is amenable to Kalman filter estimation. It can be shown that 
     
         x.sub.je (t+δ)=Φ(δ)x.sub.je (t)+Γs.sub.je (t+δ|t)-Φ(δ)p.sub.je (t)         (28) 
    
     where ##EQU10## where Equation 29 represents the additive white phase noise, Equation 30 represents the random walk phase, Equation 31 represents the random walk frequency, and Equation 32 represents the random walk frequency aging. 
     This version of the ensemble definition is in the form required for the application Kalman filter techniques. As discussed above, the advantage of the Kalman approach is the inclusion of the system dynamics, which makes it possible to include a high degree of robustness and automation in the algorithm. 
     In order to apply Kalman filters to the problems of estimating the states of a clock obeying the state equations provided above, it is necessary to describe the observations in the form of equation 6. This is accomplished by a transformation of coordinates on the raw clock time difference measurements or clock frequency difference measurements. Since z may denote either a time or a frequency observation, a pseudomeasurement may be defined such that ##EQU11## This operation translates the actual measurements by a calculable amount that depends on the past ensemble state estimates and the control inputs. 
     An additional requirement for the use of the usual form of Kalman filters is that the measurement noise, v je , is uncorrelated with the plant noise, Γs je . However, this is not true for the measurement model of equation 33. Through algebraic manipulations, it has been found that the noise perturbing the pseudomeasurements can be characterized as ##EQU12## This pseudonoise depends on the true state at time t 2  and is therefore correlated with the plant noise which entered into the evolution of the true state from time t 1  to time t 2 . The correlation of these noises is represented by a matrix C defined by 
     
         C.sup.k.sub.j (t.sub.2)≡E[s.sub.je (t.sub.2 |t.sub.1)v.sup.k.sub.je (t.sub.2).sup.T ].       (35) 
    
     For the case of a single time measurement, v is a scalar and C is a 4×1 matrix where, ##STR1## For a single frequency measurement, ##STR2## One method of resolving this difficulty is to extend the Kalman filter equations to allow correlated measurement and plant noise. 
     In this regard, it is possible to have a Kalman recursion with correlated measurement and plant noise. The error in the estimate of the state vector after the measurement at time t1 is x(t 1  |t 1 )-x(t 1 ) and the error covariance matrix is defined to be 
     
         P(t.sub.1 |t.sub.1)=E{[x(t.sub.1 |t.sub.1)-x(t.sub.1)][x(t.sub.1 |t.sub.1)-x(t.sub.1)].sup.T }                    (38) 
    
     The diagonal elements of this n x n matrix are the variances of the estimates of the components of x(t 1 ) after the measurement at time t 1 . The error covariance matrix just prior to the measurement at time t 2  is defined as 
     
         P(t.sub.2 |t.sub.1)=E{[x(t.sub.2 |t.sub.1)-x(t.sub.2)] 
    
     
          [x(t.sub.2 |t.sub.1)-x(t.sub.2)].sup.T }.        (39) 
    
     The error covariance matrix evolves according to the system model, such that 
     
         P(t.sub.2 |t.sub.1)=Φ(δ)P(t.sub.1 |t.sub.1)Φ(δ).sup.T + 
    
     
          ΓQ(t.sub.2 |t.sub.1)Γ.sup.T.         (40) 
    
     The new the state vector depends on the previous estimate and the current measurement, 
     
         x(t.sub.2 |t.sub.2)=Φ(δ)x(t.sub.1 |t.sub.1)+Φ(δ)p(t.sub.1)+K(t.sub.2)[z(t.sub.2)-H(t.sub.2)Φ(δ)x(t.sub.1 |t.sub.1)-H(t.sub.2)Φ(δ)p(t.sub.1)]    (41) 
    
     where the gain matrix, K(t 2 ), determines how heavily the new measurements are weighted. The desired or Kalman gain, K opt , is determined by minimizing the square of the length of the error vector, that is, the sum of the diagonal elements (i.e., the trace) of the error covariance matrix, such that 
     
         K.sub.opt (t.sub.2)=P(t.sub.2 |t.sub.1)H(t.sub.2).sup.T ×[H(t.sub.2)P(t.sub.2 |t)H(t.sub.2).sup.T +R(t.sub.2)+ 
    
     
          H(t.sub.2)C(t.sub.2)+C(t.sub.2).sup.T H(t.sub.2).sup.T ].sup.-1·( 42) 
    
     Finally, the updated error covariance matrix is given by ##EQU13## where I is the identity matrix. 
     Equations 40-43 define the Kalman filter. As defined, the Kalman filter is an optimal estimator in the minimum squared error sense. Each application of the Kalman recursion yields an estimate of the state of the system, which is a function of the elapsed time since the last filter update. Updates may occur at any time. In the absence of observations, the updates are called forecasts. The interval between updates, δ=t 2  -t 1 , is arbitrary and is specifically not assumed to be constant. It is possible to process simultaneous measurements either all at once or sequentially. In the present invention, simultaneous measurements are processed sequentially. When processing measurements sequentially, the matrix appearing in square brackets in equation (42) has dimensions of 1×1 and the matrix inversion reduces to the simple process of scalar inversion. Sequential processing is also compatible with outlier rejection. 
     As will be appreciated by those skilled in the art, implementation of the relationships defined in equations 40-43 as a Kalman filter is a matter of carrying out known techniques. 
     For the estimation of the reference clock versus the ensemble, the first step is the selection of a reference clock for this purpose. The reference clock referred to herein is distinguished from a hardware reference clock, which is normally used as the initial calculation reference. However, this &#34;software&#34; reference clock normally changes each time the ensemble is calculated for accuracy. 
     As discussed above, the ensemble consists of N clocks and therefore N estimates of the ensemble time exist. Thus, the first estimate of the ensemble time cannot be rejected and must be robust. To obtain this robust initial estimate, the median of the pseudomeasurements is computed. The clock which yields the median pseudomeasurement is selected as the calculation reference clock, and is designated clock r. In this regard ##EQU14## Of the N pseudomeasurements, one pseudomeasurement is a forecast and the remainder of the pseudomeasurements add new information. New pseudomeasurements must be calculated if the reference for the calculation has changed. To change reference clocks from one clock to another, i.e., from clock j to clock r, it is necessary only to form the difference, such that ##EQU15## This procedure works even if the initial reference clock (clock r) has been corrupted by some large error. 
     Once a reference clock has been identified, the plant covariance matrix may be calculated. There are ten independent elements, seven of which are nonzero. These ten elements, which correspond with Equations 13-22, are as follows: ##EQU16## 
     
         E[β&#39;.sub.re ε&#39;.sub.re ]=0                     (50) 
    
     
         E[β&#39;.sub.re η&#39;.sub.re ]=0                         (51) 
    
     
         E[β&#39;.sub.re α&#39;.sub.re ]=0                       (52) ##EQU17## 
    
     The initial state estimate at time t 2  is a forecast via the reference clock r. The initial covariance matrix is the covariance before measurement. The data from all the remaining clocks are used to provide N-1 updates. The pseudomeasurements are processed in order of increasing difference from the current estimate of the time of the reference clock r with respect to the ensemble. Pseudomeasurement I(k) is the &#34;k&#34;th pseudomeasurement processed and I(1) is the reference clock forecast. Outliers (i.e., data outside an anticipated data range) are &#34;de-weighted&#34; when processing pseudomeasurments 2 through N using the statistic ##EQU18## where the v k   re  (t 2 ) is the innovation or difference between the pseudomeasurment and the forecast, such that 
     
         v.sup.k.sub.re (t.sub.2)=z.sup.k.sub.re (t.sub.2)-H(t.sub.2)Φ(t.sub.2 |t.sub.1)[x(t.sub.1 |t.sub.1)+p(t.sub.1)].(56) 
    
     This equation can be rearranged in the form 
     
         v.sub.re (t.sub.2)=v(t.sub.2)-H(t.sub.2)[x(t.sub.2 |t.sub.1)-x(t.sub.2)]                            (57) 
    
     After squaring and taking the expectation value, the resu.lt is 
     
         E[v.sup.k.sub.re (v.sup.k.sub.re).sup.T ]=H(t.sub.2)P(t.sub.2 |t.sub.1)H(t.sub.2).sup.T +R(t.sub.2)+2H(t.sub.2)ΓC.sub.r.sup.k (t.sub.2)     (58) 
    
     To preserve the robustness of the state estimation process, deweighting of the outlier data is used rather than rejection. This preserves the continuity of the state estimates. A nonoptimum Kalman gain is calculated from ##EQU19## where ##EQU20## is the Hampel&#39;s Ψ function. 
     When this calculation is concluded, the estimates of the states of the reference clock r with respect to the ensemble have been provided. The corresponding estimates for the remaining clocks are obtained by their values with respect to the reference clock r. This procedure is used rather than estimating the clock parameters directly with respect to the ensemble because the innovations of this process are used in parameter estimation. 
     The estimates of the clocks relative to reference clock r are obtained from N-1 independent Kalman filters of the type described above. The four dimensional state vectors are for the clock states relative to the reference clock r ##EQU21## Every clock pair has the same state transition matrix and Γ matrix, which are provided for above in equations 3 and 5. The system covariance matrices are Q ir  (t+δ|t). The white phase noise is given by the measurement model 
     
         z.sub.ri =Hx.sub.ri +v.sub.ri                              (62) 
    
     where each measurement is described by the same 4×1 row matrix 
     
         H.sub.ri =(1 0 0 0) or (0 0 1 0)                           (63) 
    
     The updated difference dates are provided in equation 41, which is one of the equations which define the Kalman filter. No attempt is made to independently detect outliers. Instead, the deweighting factors determined in the reference clock versus ensemble calculation are applied to the Kalman gains in the clock difference filters. The state estimates for the clocks with respect to the ensemble are calculated from the previously estimated states of the reference clock r with respect to the ensemble and the clock difference states, such that 
     
         x.sub.je (t.sub.2 |t.sub.2)=x.sub.re (t.sub.2 |t.sub.2)-x.sub.rj (t.sub.2 |t.sub.2)   (64) 
    
     This essentially completes the calculation of ensemble time. The remaining task is to update all of the parameters used in the computation. The parameter estimation problem is discussed more completely below. Briefly, the parameter estimates are obtained from prediction errors of all possible clock pairs. Accordingly, rather than computing Kalman filters for N-1 clock pairs, the calculations are performed for N(N-1)/2 pairs, ij, for i=1 to N-1 and j=i+1 to N. Certainly, in a large ensemble, this may entail significant computation. But little information is added by comparison of noisy clocks with one another. For each noise type, a list of the five clocks having the lowest noise can be formed. If the index i is restricted to this more limited range, then only 5N-15 filters are required for each parameter estimated. 
     The outlier detection algorithm of the ensemble calculation identifies the measurements which are unlikely to have originated from one of the processes included in the model. These measurements are candidate time steps. The immediate response to a detected outlier in the primary ensemble Kalman filter is to reduce the Kalman gain toward zero so that the measurement does not unduly influence the state estimates. However, the occurrence of M 1  successive outliers is interpreted to be a time step. The time state of the clock that experienced the time step is reset to agree with the last measurement and all other processing continues unmodified. If time steps continue until M 2  successive outliers have occurred, as might happen after an extremely large frequency step, then the clock should be reinitialized. The procedure for frequency steps should be used to reinitialize the clock. 
     Most frequency steps are too small to produce outliers in the primary ensemble Kalman filter. This is because the small frequency steps do not result in the accumulation of large time errors during a single sample interval. Thus, all but the largest frequency steps are detected in secondary ensemble Kalman filters that are computed solely for this purpose. A set of filters with a range of sample intervals will result in the early detection of frequency steps and also produce near optimum sensitivity for a variety of clocks and performances. Recommended sample intervals are one hours, twelve hours, one day, two days, four days, eight days and sixteen days. Since time steps have already been detected (and rejected) using the primary ensemble filter, outliers detected by the secondary filters are considered to have resulted from frequency steps. 
     When a frequency step is detected in one of the clocks, for example, clock k, it is desirable to reduce the time constant for learning the new frequency. Therefore, a new value is calculated for the spectral density of the random walk frequency noise. First, the estimate of S.sub.μ k  is increased sufficiently so that the detected outlier would have been considered normal. Then, the weights of the clock k are decreased to small values or zero to protect the ensemble. The clock k is then reinitialized using a clock addition procedure. 
     As discussed previously, the clock weights are positive, semidefinite, and sum to one, without any other restriction. It is possible to calculate a set of weights which minimizes the total noise variance of the ensemble. First, the variance of the noise in the ensemble states is calculated. This is represented by the following equations: ##EQU22## The weights which minimize the noise on the states u e , y e , and w e  are obtained by minimizing the appropriate diagonal elements of Γs e  s e   T  Γ T , such that ##EQU23## Alternatively, the weights can be chosen to have equal weighting for each member of the ensemble. In this case, a k  =b k  =c k  =1/N. 
     Whatever the method used, the clock weights are chosen in advance of the calculation. However, if there is one or more outliers, the selected weights are modified by the outlier rejection process. The actual weights used can be calculated from ##EQU24## where K&#39; I (1) is defined as 1 and the indexing scheme is as previously described. To preserve the reliability of the ensemble, one usually limits the weights of each of the clocks to some maximum value a max . Thus, it may be necessary to readjust the initial weight assignments to achieve the limitation or other requirements. If too few clocks are available, it may not be possible to satisfy operational requirements. Under these conditions, it may be possible to choose not to compute the ensemble time until the requirements can be met. However, if the time must be used, it is always better to compute the ensemble than to use a single member clock. 
     Another problem to be considered in the Kalman approach is the estimation of the parameters required by a Kalman filter. The techniques that are normally applied are Allan variance analysis and maximum likelihood analysis. However, in using the Allan variance, there is a problem in that the Allan variance is defined for equally spaced data. In an operational scenario, where there are occasional missing data, the gaps may be bridged. But when data are irregularly spaced, a more powerful approach is required. 
     The maximum likelihood approach determines the parameter set most likely to have resulted in the observations. Equally spaced data are not required, but the data are batch processed. Furthermore, each step of the search for the maximum requires a complete recomputation of the Kalman filter, which results in an extremely time consuming procedure. Both the memory needs and computation time are incompatible with real time or embedded applications. 
     A variance analysis technique compatible with irregular observations has been developed. The variance of the innovation sequence of the Kalman filter is analyzed to provide estimates of the parameters of the filter. Like the Allan variance analysis, which is performed on the unprocessed measurements, the innovation analysis requires only a limited memory of past data. However, the forecast produced by the Kalman filter allows the computation to be performed at arbitrary intervals once the algebraic form of the innovation variance has been calculated. 
     The innovation sequence has been used to provide real time parameter estimates for Kalman filters with equal sampling intervals. The conditions for estimating all the parameters of the filter include (1) the system must be observable, (2) the system must be invariant, (3) number of unknown parameters in Q (the system covariance) must be less than the product of the dimension of the state vector and the dimension of the measurement vector, and (4) the filter must be in steady state. This approach was developed for discrete Kalman filters with equal sampling intervals, and without modification, cannot be used for mixed mode filters because of the irregular sampling which prevents the system from ever reaching steady state. However, it is possible to proceed in a similar fashion by calculating the variance of the innovations in terms of the true values of the parameters and the approximate gain and actual covariance of the suboptimal Kalman filter that produces the innovation sequence. The innovation vector is the difference between the observation and the prediction, as follows: 
     
         v.sub.ij (t.sub.2)≡z.sub.ij (t.sub.2)-H.sup.ij (t.sub.2)x.sub.ij (t.sub.2 |t.sub.1).                              (73) 
    
     By substituting equation 73 in the measurement model (equation 6) 
     
         E[v(t.sub.2)v(t.sub.2).sup.T ]=H(t.sub.2)P(t.sub.2 |t.sub.1)H(t.sub.2).sup.T +R(t.sub.2)            (74) 
    
     since the measurement noise is uncorrelated with system noise for the clock difference filters. 
     Adaptive modeling begins with an approximate Kalman filter gain K. As the state estimates are computed, the variance of the innovations on the left side of equation 74 is also computed. The right side of this equation is written in terms of the actual filter element values (covariance matrix elements) and the theoretical parameters. Finally, the equations are inverted to produce improved estimates for the parameters. The method of solving the parameters for discrete Kalman filters with equal sampling intervals is inappropriate here because the autocovariance function is highly correlated from one lag to the next and the efficiency of data utilization is therefore small. Instead, only the autocovariance of the innovations for zero lags, i.e., the covariance of the innovations, is used. The variances are given by ##EQU25## for the case of a time measurement, and ##EQU26## for the case of a frequency measurement. It is assumed the oscillator model contains no hidden noise processes. This means that each noise in the model is dominant over some region of the Fourier frequency space. The principal of parsimony encourages this approach to modeling. Inspection of equation 75 leads to the conclusion that each of the parameters dominates the variance of the innovations in a unique region of prediction time interval, δ, making it possible to obtain high quality estimates for each of the parameters through a bootstrapping process. It should be noted that the white phase measurement noise can be separated from the clock noise only by making an independent assessment of the measurement system noise floor. 
     For each parameter to be estimated, a Kalman filter is computed using a subset of the data chosen to maximize the number of predictions in the interval for which that parameter makes the dominant contribution to the innovations. The filters are designated 0 through 4, starting with zero for the main state estimation filter, which runs as often as possible. Each innovation is used to compute a single-point estimate of the variance of the innovations for the corresponding δ. Substituting the estimated values of the remaining parameters, equation 75 is solved for the dominant parameter, and the estimate of that parameter is updated in an exponential filter of the appropriate length, for example, ##EQU27## 
     If the minimum sampling interval is too long, it may not be possible to estimate one or more of the parameters. However, there is no deleterious consequence of the situation, since a parameter that cannot be estimated is not contributing appreciably to the prediction errors. Simulation testing has shown that the previously described method combines good data efficiency and high accuracy. 
     Each time a clock pair filter runs, a single estimate is obtained for one of the noise spectral densities or variances of the clock, represented by F ij . A Kalman filter can be used to obtain an optimum estimate for all F i , given all possible measurements F ij . The F i  for a given noise type are formed into an N dimensional vector ##EQU28## The state transition matrix is just the N dimensional identity matrix. The noise vector is chosen to be nonzero in order to allow the estimates to change slowly with time. This does not mean that the clock noises actually experience random walk behavior, only that this is the simplest model that does not permanently lock in fixed values for the noises. The variances of the noises perturbing the clock parameters can be chosen based on the desired time constant of the Kalman filter. Assuming that the noise is small, the Kalman gain is approximately σ F  /σ meas . The parameter value will refresh every M measurements when its variance is set to 1/M 2  of the variance of the single measurement estimate of the parameter. A reasonable value for the variance of a single measurement is σ 2   meas  being approximately equal to 2F i . The measurement matrix for the &#34;ij&#34;th measurement is a 1×N row vector whose &#34;i&#34;th and &#34;j&#34;th elements are unity and whose remaining elements are zero, such that H ij  =[0 . . . 010 . . . 010 . . . 0]. All the individual clock parameters are updated each cycle of the Kalman recursion, even though the measurement involves only two clocks, because the prior state estimates depend on the separation of variances involving all of the clocks. 
     The storage requirements for this approach are minimal. There are five N element state vectors, one for each of the possible noise types (white phase noise, white frequency noise, white frequency measurement noise, random walk frequency noise, and random walk frequency noise aging). There are also five N×N covariance matrixes. A total of 5N(N-1)/2 cycles of the Kalman recursion are currently believed necessary for the parameter update. 
     An implementation of the present invention will now be described with respect to FIG. 1. FIG. 1 illustrates a circuit for obtaining a computation of ensemble time from an ensemble of clocks 10. The ensemble 10 includes N clocks 12. The clocks 12 can be any combination of clocks suitable for use with precision time measurement systems. Such clocks may include, but are not limited to cesium clocks, rubidium clocks and hydrogen maser clocks. Additionally, there is no limit on the number of clocks. 
     Each of the N clocks 12 produces a respective signal μ 1 , μ 2 , μ 3 , . . . μ N  which is representative of its respective frequency output. The respective frequency signals are passed through a passive power divider circuit 14 to make them available for use by a time measurement system 16, which obtains the time differences between designated ones of the clocks 12. As discussed above, the desired time differences are the differences between the one of the clocks 12 designated as a hardware reference clock and the remaining clocks 12. The clock 12 which acts as the reference clock can be advantageously changed as desired by an operator. For example, if clock 12 designated &#34;clock 1&#34; is chosen to be the reference clock, the time measurement system 16 determines the differences between the reference clock and the remaining clocks, which are represented by z 12 , z 13 , z 14 , . . . z 1N . These data are input to a computer 18 for processing in accordance with the features of the present invention as described above, namely, the complete ensemble definition as provided above. When the ensemble definition as provided by equations 23-25 is provided for in Kalman filters, and since the Kalman filters are software-implemented, the Kalman filters can be stored in memory 20. The computer 18 accesses the memory 20 for the necessary filters as required by the system programming in order to carry out the time scale computation. The weights and other required outside data are input by operator through a terminal 22. Upon completion of the processing of the clock data via the Kalman filters according to the present invention, an estimate of the ensemble time is output from the computer 20 to be manipulated in accordance with the requirements of the user. 
     As discussed above, Kalman filters have been previously used in connection with ensembles to obtain ensemble time estimates. These Kalman filters embodied the previous incomplete ensemble definitions in Kalman form for the appropriate processing. Accordingly, it will be appreciated by those skilled in the art that the actual implementation of the Kalman equations into a time measurement system as described above and the appropriate programming for the system are procedures known in the art. As also should be appreciated, by providing a complete definition of the ensemble, the present system generally provides a superior calculation of the ensemble time with respect to prior art. 
     While one embodiment of the invention has been discussed, it will be appreciated by those skilled in the art that various modifications and variations are possible without departing from the spirit and scope of the invention.