Measurement Error Time-Correlation Modeling for Safety-Critical Navigation

  • NAVIGATION: Journal of the Institute of Navigation
  • December 2025,
  • 72
  • (4)
  • navi.721;
  • DOI: https://doi.org/10.33012/navi.721

Abstract

In this paper, we develop and evaluate two new methods to derive high-integrity models of measurement error time correlation from experimental data. These models enable the determination of sequential estimation error variance bounds in safety-critical navigation applications such as aircraft localization based on global navigation satellite systems and inertial navigation systems. We achieve tight bounding models from empirical data based on lagged product distributions instead of autocorrelation functions in the time domain and based on scaled periodogram distributions instead of power spectra in the frequency domain. We bound these distributions using first-order Gauss–Markov process (FOGMP) models, which provide a means to account for error time correlation and can be easily incorporated in linear estimators. To determine bounding models, we identify theoretical probability density functions of lagged products and derive the cumulative distribution function of scaled periodograms for FOGMPs. We implement and evaluate these two methods using simulated samples and experimental Global Positioning System data collected in a mild multipath environment.

Keywords

1 INTRODUCTION

In this paper, we develop two high-integrity modeling methods using sample estimates of measurement error time correlation to achieve probabilistic bounds on linear estimation errors. These methods are intended for global navigation satellite system (GNSS)-based navigation in transportation applications.

Safety-critical land and air navigation applications require high-integrity measurement error models. Overbounding theory provides a means for modeling measurement error distributions in a way that guarantees bounds on positioning errors with integrity (Blanch et al., 2017; DeCleene, 2000; Rife et al., 2006). Overbounding is used in advanced receiver autonomous integrity monitoring to establish nominal, fault-free error models that are valid 99.999% of the time (Working Group C - ARAIM Technical Subgroup, 2016). However, these models are only valid for “snapshot” estimators using measurements at a single instant in time. Thus,current error modeling limitations set restrictions on the estimation processes that can be used in high-integrity navigation applications.

Sequential estimators such as Kalman filters (KFs) and sequential batch estimators can achieve higher accuracy as compared with snapshot estimation. With regard to integrity, error modeling over time still presents unaddressed challenges. Methods have emerged for deriving time-correlation models of measurement errors that guarantee analytical bounds on positioning errors, assuming that the true error correlation structure is known, which is rarely true in practice (Crespillo et al., 2023; Joerger et al., 2023; Langel et al., 2019, 2021).

To address this limitation, upper and lower bounds can be placed on the unknown measurement error autocorrelation function (ACF) by using the ACFs of two first-order Gauss-Markov process (FOGMP) models (Langel et al., 2019). A FOGMP is a first-order autoregressive process and is the discrete-time Gaussian expression of the Ornstein–-Uhlenbeck process (Maller et al., 2009). The two-FOGMP measurement model can then be used to bound the estimation error variance (Langel, 2014). This method was used by Gallon et al. (2019), Perea (2019), and Pervan et al. (2017) to model GNSS satellite orbit and clock ephemeris as well as troposphere and multipath error time correlation. FOGMP models are used because they are compatible with Gaussian overbounding. FOGMPs can also be easily incorporated in linear batch estimators and in KFs by state augmentation. However, estimated ACFs used to derive FOGMP models are noisy when the sample error data are sparse. Empirical ACFs can also have outliers, causing overly conservative models. Empirical ACFs can even have negative values, which cannot be rigorously lower-bounded via a positive-valued FOGMP ACF.

As an alternative, a measurement error time-correlation model can be derived by upper-bounding the power spectral density (PSD) of the sample data. PSD upper-bounding at the measurement level guarantees an upper bound on the state estimation error variance (Langel et al., 2020). This approach was used by Crespillo et al. (2020) and Gallon et al. (2021, 2022) to derive PSD-bounding FOGMP models for Global Positioning System (GPS) orbit and clock errors, tropospheric delays, and inertial biases. Unfortunately, this frequency-domain method also provides loose error bounds when the sample data are sparse or have outliers.

To address these limitations, in this paper, we derive two new methods to overbound lagged products in the time domain and scaled periodograms in the frequency domain. The tightness of the resulting error bounds is compared against ACF and PSD bounding and is analyzed via simulated and experimental data.

A lagged product is a product of two measurement error samples separated by a lag time. In the new time-domain method, we determine upper- and lower-bounding FOGMP models for an empirical sample distribution of measurement error lagged products by deriving a closed-form expression for the cumulative distribution functions (CDF) of the FOGMP lagged products.

In the new frequency-domain method, we partition the sample measurement error data to compute periodograms of individual data segments. The resulting FOGMP model is one whose theoretical periodogram distribution, for which we derive a closed-form expression, overbounds the scaled periodogram distribution of the sample measurement error at all frequencies.

The contributions of this paper are as follows. First, we develop a new time-domain measurement error time-correlation modeling method using CDF overbounding of lagged products. Second, we develop a new frequency-domain modeling method using CDF overbounding of periodograms. Third, we analyze the differences of these two methods with existing ACF- and PSD-based modeling approaches, and we implement both methods using experimental data.

A comparison between the time-domain and frequency-domain methods is not an objective of this paper. Such a comparison cannot be made at the measurement level because the former method relies on a pair of measurement error correlation functions whereas the latter requires only a single bounding model. To achieve a fair comparison, the estimation error bounds must be compared, but those bounds are estimator-dependent (Gallon et al., 2022; Langel, 2014; Langel et al., 2024). Therefore, this paper focuses on deriving sample-bounding measurement error modeling methods that are more widely applicable than the existing ACF- and PSD-based methods.

This paper is organized as follows. In Sections 2 and 3, the time-domain and frequency-domain methods are derived, respectively. In Section 4, both methods are implemented using simulated FOGMP and non-FOGMP error data. In Section 5, the methods are applied to ionospheric-error-free code-minus-carrier (IF CMC) GPS data collected in a mild multipath environment. Conclusions are presented in Section 6.

2 TIME-DOMAIN METHOD

In this section, a new method is developed for measurement error timecorrelation modeling in the time domain.

2.1 Background on Time-Correlation Modeling in the Time Domain

We introduce the time-domain modeling method reported by Langel (2014) using the following simplified illustrative example of an unbiased, linear, scalar state estimation process using two scalar measurements arranged in a batch observation vector. The scalar state estimation error ετ at time τ is given as follows:

ετ=a0aτv0vτ=a0v0+aτvτ 1

where a0 and aτ are the estimator coefficients (derived in Appendix F for an example least-squares estimator) and v0 and vτ are the measurement errors at times 0 and τ, respectively. The measurement errors are outputs of a zero-mean wide-sense stationary (WSS) process. This process has a known variance Ev02=Evτ2=σv2 and an uncertain ACF r(τ), with rτ=Ev0vτ, where E[.] is the expectation operator. The estimation error variance σε2 at time τ can be expressed as follows:

σε2=σv2a02+aτ2+2a0aτr(τ) 2

We can upper-bound σε2 in Equation (2) if bounds on r(τ) are known. For example, a tight upper bound on σε2 is found by using a knowledge of the sign of a0aτ and assuming upper and lower bounds on r(τ) (Langel, 2014; Langel et al., 2019). Upper- and lower-bounding ACFs can be derived from FOGMP models and expressed as follows:

rmaxτ=σmax2expτTmaxandrminτ=σmin2expτTminforτ0,τop3

where the notation exp(·) designates an exponential function and τop is an operational limit on lag times of interest. The upper- and lower-bounding FOGMP model ACFs in Equation (3) are decaying exponential functions with FOGMP time constants Tmax and Tmin and variance σmax2 and σmin2 as parameters, respectively. In practice, the measurement error ACF is estimated from data for lag times τ ranging from zero to τop. For example, GPS satellite clock and orbit ephemeris errors do not need to be modeled over a lag-time interval larger than τop = 7 h, which is the maximum duration of a satellite pass for a ground user (Gallon et al., 2019; Perea, 2019).

Figure 1 illustrates the paired ACF bounding procedure for 80 simulated sample ACFs drawn from the same FOGMP with unit variance and a time constant of T = 50 s. Lag times are displayed from 0 to 100 s. The 80 ACFs are generated by using 80 independent 100-s-long time series. The 100-s limit captures the fact that the actual error data may be sparse or may need to be partitioned to meet the WSS assumption (Gallon et al., 2022). Even though all 80 curves are drawn from the same FOGMP, variations between sample ACFs are significant because of data sparsity.

FIGURE 1

Overview of the paired ACF bounding process for a unit-variance FOGMP with a time constant of 50 s using 100-s-long data time series

The dotted and solid black curves in Figure 1 indicate the upper and lower FOGMP ACF bounds obtained with the assumption of unit variance. The gray sample ACFs cannot be fully lower-bounded because they have negative values for lag times τ approaching 35 s. In this example, if the time-correlation model is to be used over τop intervals longer than 35 s, a different method is needed.

2.2 Time-Correlation Modeling Using Lagged Products

This section aims to address the limitations of FOGMP ACF bounding by finding a FOGMP model that “overbounds lagged products” for all values of τ belonging to 0τop and for all quantiles of the lagged product CDF. First, we introduce and define lagged products. Second, we formulate a closed-form expression for the probability density function (PDF) of the FOGMP lagged products. Third, we relate lagged product overbounding to ACF upper- and lower-bounding.

In the first part of this section, we define a lagged product as follows:

q(τ)=v0vτ4

Given a lag time τ, the lagged product is a random variable whose mean value is the ACF, r(τ). The distribution of q(τ) can be modeled by using overbounding theory. Widely used in GNSS-based safety critical aviation applications (RTCA Special Committee 159, 2001, 2004; Working Group C - ARAIM Technical Subgroup, 2016), overbounding provides a means to compare and model non-Gaussian probability distributions. In addition, if an error model’s CDF overbounds sample measurement errors, then this model function (e.g., a Gaussian) can be used to predict an overbound on the actual estimation error’s CDF, even if the latter is non-Gaussian (Blanch et al., 2017; DeCleene, 2000; Rife et al., 2006). To determine an overbounding model for q(τ), all quantiles of its distribution must be considered for all values of τ0,τop. Because error modeling is performed offline, the computational load of this two-dimensional approach is not prohibitive.

Figure 2(a) shows 2500 sample lagged product curves for a FOGMP with variance σv2=1 and time constant T = 50 s over lag times ranging from 0 to 100 s. For each value of τ, the q(τ)-sample CDF is determined, with quantile curves shown in Figure 2(b). In contrast with the FOGMP ACF, quantiles of lagged products can have negative values.

FIGURE 2

(a) 2500 lagged product curves for a FOGMP with unit variance and time constant T = 50 s; (b) sample quantiles of the lagged product distribution

The second part of this section aims at deriving a parametric, closed-form expression of the lagged product distribution of a FOGMP model, which will then be used to overbound the empirical distribution of q(τ) samples. A discrete-time FOGMP vn at time step n with time constant T can be expressed as follows:

vn=expΔtTvn1+ηn1whereηnN0,ση2withση2σv21exp2ΔtT5

We use the notation vnN0,σv2 to designate the fact that vn is normally distributed with zero mean and variance σv2.

We use the formulas from Cui et al. (2016) to derive the following closed-form expression of the FOGMP lagged product PDF:

fqτx=1πσv21α2expxασv21α2K0xσv21α2withαexpτT6

where k0. is the modified Bessel function of the second kind of order zero. When τ=0, the lagged product is v02, and as expected, Equation (6) simplifies to a one-degree-of-freedom chi-square distribution scaled by σv2 (as shown in Appendix D). As the lag time approaches infinity, the correlation between v0 and vτ approaches zero, and the lagged product tends to be distributed according to a modified Bessel function of the second kind (symmetric around zero).

Equation (6) is used in Figure 3(a) to represent the theoretical PDF of a FOGMP with T = 50 s and σv2=1. We numerically integrate this PDF to obtain the model lagged product CDF for each lag time of interest. Lines of constant probability are displayed in Figure 3(b) and represent the theoretical quantile lines corresponding to the sample quantiles in Figure 2.

FIGURE 3

(a) PDF of FOGMP lagged products; (b) CDF quantiles of a FOGMP with unit variance and time constant T = 50 s

The third part of this section shows that overbounding the FOGMP lagged product CDF can guarantee upper and lower ACF bounds. We apply the following theorem derived in Appendix B and first used by Jada and Joerger (2020):

Theorem: For an arbitrary CDF FAx with mean μA and for any CDF upper-bounding and lower-bounding functions FU(x) and FL(x) with mean values μU and μL, respectively, such that:

FUxFAxxandFLxFAxx7

the following inequalities are always satisfied:

μUμAandμLμA8

Applied to lagged product overbounding, the mean of the CDF upper-bounding FOGMP, σmin2expτ/Tmin, provides a lower bound for the mean of the actual distribution, Eqτ; the mean of the CDF lower-bounding FOGMP, σmin2expτ/Tmin, provides an upper bound for Eqτ. Thus, the time-correlation models in Equation (3) are determined by finding the pair of FOGMPs whose lagged product CDFs upper- and lower-bound the sample CDF for all τ values at all quantiles.

2.3 Step-by-Step Procedure for Time-Correlation Modeling in the Time Domain

Consider a measurement error data set with LN samples partitioned into L time series of N samples each and expressed in matrix form as follows:

Vv1τ0v1τN1vLτ0vLτN1,withN=τopΔt9

where τn=nΔt for n = 0, …, N – 1, Δt is the sampling interval, and τop is the required model validity period. Each row of V is a time series over τop. The lag τop is greater than two time constants, ensuring that the time series include uncorrelated samples, i.e., separated by a time interval larger than or equal to τop.

We multiply each row by its first element to obtain the following lagged product matrix:

Qq1τ0q1τN1qLτ0qLτN1,withq1τnvl,0vl,nforl=1,,L10

At any given lag time τn, we have a column vector of L sample lagged products, q1τn,,qLτnT. Figure 2 presents results for an example Q matrix with N = 100 and L = 2500.

Next, we sort each column of Q in ascending order of its elements and arrange the elements in the following matrix form:

Qsortedq1τ0q1τN1qLτ0qLτN1,Whereq1τnql+1τn11

The subscript notation (·) designates sorted indices. Let F1,nFL,nT be the L × 1 empirical CDF vector derived from [q(1)(τn)q(L)(τn)]T for lag time τn. The empirical CDF vectors at all N lags are captured in the following matrix form:

FF1,0F1,N1FL,0FL,N112

We find the FOGMP model parameters Tmin, σmin, Tmax, and σmax by ensuring that the upper- and lower-bounding model CDFs Fl.nTmin,σmin and Fl.nTmax,σmax satisfy the following inequalities:

Fl,nTmax,σmaxFl,nFl,nTmin,σmin,forl=1,...,Landn=0,...,N113

Figure 4(a) shows 2000 gray lagged product curves for 100-s-long time series of a simulated FOGMP with T = 50 s and σ = 1. The top left-hand-side chart displays Fl.nTmax,σmax with blue dashed lines bounding four example sample quantile curves at 2%, 16%, 84%, and 98% to determine Tmax = 90 s and σmax = 1.05. The bottom left-hand-side chart displays Fl.nTmin,σmin (green dashed-dotted line) lower-bounding quantile curves to determine Tmin = 10 s and σmin = 0.96. Figure 4(b) shows q(τ)-CDF upper and lower bounds at example lag times of τ = 1 s, τ = 20 s, and τ = 50 s.

FIGURE 4

Simulated data with upper- and lower-bounding FOGMP models for (a) example quantiles over all lag times and (b) example lag times at all quantiles

For a more complete visualization, Figures 5(a) and 5(b) show the differences between the sample CDF and the upper- and lower-bounding model CDFs, respectively, for all lag times and quantiles. The color code designates the tightness of the bound, with a tight bound indicated by blue and a loose bound indicated by yellow. If the pair of model functions failed to bound the empirical CDF, the CDF difference would be shown in red. In this example, the CDF bounds are loosest at the core of the distributions (for sample quantiles ranging from 5% to 95%) for τ ≥ 30 s for Fl,nTmax,σmax and for τ ≥ 30 s for Fl,nTmin,σmin. This finding is consistent with well-established snapshot overbounding methods reported by Blanch et al. (2017), DeCleene (2000), and Rife et al. (2006): bounding a fat-tailed distribution via a low-order parametric model captures the distribution tails at the cost of a loose bound of the core. Loose measurement error bounds for some quantiles can cause loose estimation error bounds (Crespillo et al., 2023; Joerger et al., 2023; Langel et al., 2020), but this trade-off is necessary to achieve practical, computationally efficient, and memory-efficient error modeling in high-integrity estimation.

FIGURE 5

Contour plots showing the color-coded difference between the model CDF and sample CDF for the (a) lower-bounding FOGMP model CDF and (b) upper-bounding FOGMP model CDF

Positive values throughout indicate that the models are bounding at all lag times and CDF quantiles.

Model determination using a previously recorded data set that is representative of operating conditions is performed offline and only needs to be performed once for a given data set. In this context, we visually tuned the FOGMP models in Figures 4 and 5 by iteratively modifying the FOGMP parameters, starting from an initial guess and adjusting the model until its distribution bounds the sample distribution while reducing the yellow-shaded areas in Figure 5. We selected the values of Tmin, σmin or Tmax, σmax to achieve as tight a bound as possible. Further model parameter optimization is relevant and is an active area of research for PSD bounding (Crespillo et al., 2023; Gallon & Veiga, 2024; Joerger et al., 2023; Langel et al., 2024), but is beyond the scope of this paper.

3 FREQUENCY-DOMAIN METHOD

In this section, a new method is developed for measurement error time-correlation modeling in the frequency domain.

3.1 Background on Time-Correlation Modeling in the Frequency Domain

With time-domain modeling methods, there is no generic approach to recursively compute a bounding estimation error variance using parametric models of non-FOGMP time-correlated measurement errors. The method reported by Langel (2014), which is illustrated in Equation (2), requires that all individual estimator coefficients over time (a0 and aτ in Equation (1)) be stored and processed at each time step. For recursive, infinite-horizon estimators such as KFs, the number of estimator coefficients over time increases without bound. Therefore, storing estimator coefficients over time, as done by Langel (2014), is both computationally expensive and memory-expensive and can be intractable in long-duration, high-sampling rate implementations (Crespillo et al., 2023).

Frequency-domain time-correlation modeling provides a practical solution for estimation error modeling in recursive implementations (Gallon et al., 2022; Langel et al., 2024). We use the following illustrative scalar example from Gallon et al. (2021) to introduce PSD upper-bounding. A scalar output deviation ε(t) is estimated using a steady-state KF with scalar zero-mean stationary noise input measurement deviations v(t).

The real-valued measurement error PSD s(ω) is a periodic function of the circular frequency ω0,π . The circular frequency ω, in units of radians, is related to the frequency f in Hertz through ω=2πfΔt, where Δ(t) is the sampling interval (Chatfield & Xing, 2019, Chapter 6). If the KF is designed assuming s¯ω and if the KF transfer function from v(t) to ε(t) is H(ω), then the mean of the KF output error is zero, and the true and predicted output error variances, respectively, are as follows:

σε2=0πHω2sωdωandσ¯ε2=0πHω2s¯ωdω14

If s¯ω>_sω for all ω0π, then σ2ε>_σ2ε. The PSD upper bound s¯ω can be used to define a time-correlated measurement error model that guarantees an upper bound on the KF estimation error variance (Gallon et al., 2021; Langel et al., 2020).

In practice, measurement error PSDs can be estimated from data. The PSD is defined as the discrete-time Fourier transform of the ACF, which can be expressed using the Wiener-Khinchin theorem as follows (Chatfield & Xing, 2019, Chapter 6):

sω1πn=rτneiωn15

where i is the unit imaginary number and r(τn) is the ACF at lag time τn=nΔt. ACF estimation from actual data requires averaging over multiple time series and using a tapered windowing function as described by Langel et al. (2020). These additional processing steps can introduce additional uncertainty in the PSD estimation process. An alternative is to use periodograms. For a measurement error time series vn for n = 0, …, N = 1, a periodogram can be defined as follows:

Ρωfωfω¯withfωn=0N1vneiωnforω0,π16

where f(ω) is the discrete Fourier transform (DFT)(f(ω)). The ¯ notation designates complex conjugation. The PSD can then be defined as follows (Chatfield & Xing, 2019, Chapter 7):

sω1πlimNEΡωN17

In Figure 6, the top block diagram displays PSD estimation from the ACF, whereas the bottom diagram represents a periodogram-based PSD estimate.

FIGURE 6

A block diagram depicting two different PSD estimation schemes

The top branch shows ACF-based PSD estimation, and the bottom shows periodogram-based PSD estimation. The (^) notation is used for estimates, and 2 represents the squared magnitude of a complex number.

Gallon et al. (2020), Gallon et al. (2021, 2022), and Langel et al. (2020) generated multiple PSD estimates to account for different satellite clock types when analyzing orbit and clock ephemeris errors and to account for seasonal variations when analyzing tropospheric errors. FOGMP models were derived whose PSDs provide an upper bound for the worst-case sample PSD, which is conservative, but does not account for the probability of occurrence of outlier events.

The following section describes a refined method using CDF overbounding of sample scaled periodograms ω/πN to determine a PSD upper bound. This periodogram distribution is derived from measurement error time series using the bottom block diagram in Figure 6, but without the last block, in which the mean value is taken. A key step in achieving periodogram overbounds is the derivation of a closed-form, parametric expression of FOGMP scaled periodogram distributions.

3.2 Scaled Periodogram Approach to Time-Correlation Modeling

In Appendix A, we show that the scaled periodogram of a FOGMP can be expressed as a linear combination of two independent chi-square random variables y12 and y22 with a single degree of freedom. Here, we use the notation y12χ21 and y22χ21. A scaled periodogram can be expressed as follows:

ΡωπN=λ12πNy12+λ22πNy2218

where λ12 and λ22 are the two real eigenvalues of the following symmetric positive definite matrix:

ΛΛTRe(c)TIm(c)Tσv2000ση2000ση2Re(c)Im(c)2×2 19

Here, σv2 and T are the variance and time constant of the FOGMP, respectively, ση2 is the variance of the FOGMP driving noise defined in Equation (5), and cN×1 is a vector of complex numbers. We use the notations Re(.) and Im(.) to designate the element-wise real and imaginary parts of a complex vector. The n-th element of c is defined as follows:

cnexpinω1expΔtTiωNn1expΔtTiω,n=0,,N120

Thus, λ12 and λ12 depend on T, σv2 Δ(t), N, and the DFT frequency ω. Because λ12 and y22 are not necessarily equal, the scaled periodogram in Equation (18) is distributed according to a generalized chi-square distribution. We can use the numerical approach from Davies (1980) to compute the scaled periodogram PDF and CDF.

Figure 7 shows the PDF and CDF of an example FOGMP with T = 50 s and Δv2=1 for =t = 1 s and N = 1000. For a sufficiently large number of samples N, the mean of the scaled periodogram approaches the PSD (see Equation (17)). Therefore, using the theorem in Section 2.2, a CDF lower bound on the scaled periodogram guarantees a PSD upper bound. To model the measurement error time correlation, i.e., to obtain a tight upper bound on measurement error PSD, we find the FOGMP whose scaled periodogram CDF gives a lower bound for the sample CDF at all frequencies.

FIGURE 7

(a) The PDF surface and (b) quantiles of a scaled periodogram of a FOGMP with time constant T = 50 s and variance σv2=1 for a time series of N = 1000 samples with a time step of Δt = 1 s

3.3 Step-by-Step Procedure for Time-Correlation Modeling in the Frequency Domain

Consider the partitioned measurement error matrix V defined in Equation (9). We compute scaled periodograms following the bottom branch in Figure 6 (without the last block) at discrete circular frequency values wn0,π, for example, for n = 0, ⋯, N – 1 at N logarithmically spaced intervals. The sorted scaled periodograms are expressed in matrix form as follows:

Ρsorted1Nπp1ω0p1ωN1pLω0pLωN121

where the time series index (l) is sorted in ascending order of scaled periodogram value for each given frequency. Thus, the elements in a row of Psorted are scaled periodograms for the same time series at N different frequencies, and the elements in a column are scaled periodogram values for different time series at the same frequency.

Let F1,n,,FL,nT be the empirical CDF vector evaluated at p1wn,, pLwnT for frequency ωn. The empirical CDFs at all N frequencies are arranged in the following matrix:

FF1,0F1,N1FL,0FL,N1 22

We find the FOGMP model parameters Tmax and σmax2 such that the model CDF F1,n(Tmax,σmax2) satisfies the following inequality:

Fl,nTmax,σmax2Fl,nforl=1,,Landn0,,N1 23

The FOGMP model’s CDF is evaluated at the same ωn and quantile values as the empirical CDF.

Figure 8(a) shows 2000 gray lagged product curves for 100-s-long time series of a simulated FOGMP with T = 50 s and σ = 1. The left-hand-side chart displays Fl,n(Tmax,σmax) with blue dashed lines bounding four example sample quantile curves (solid black) at 2%, 16%, 84%, and 98% to determine Tmax = 50 s and σmax = 1.3. Figure 8(b) shows q(τ)-CDF upper and lower bounds at example circular frequencies of ωn=102πrad, ωn=101πrad, and ωn=10πrad.

FIGURE 8

Simulated data with a CDF lower-bounding FOGMP model for (a) example quantiles at all circular frequencies and (b) example circular frequencies at all quantiles

Figure 9 shows the differences between the sample CDF and the CDF- lower-bounding model CDF for all circular frequencies and quantiles. The color code represents the tightness of the bound, with a tight bound indicated in blue and a loose bound indicated in yellow. If the model failed to bound the empirical CDF, i.e., if Equation (23) was not satisfied, the CDF difference would be shown in red. In this example, the CDF bounds are loosest at the core of the distributions and for ωn0.03 rad, i.e., near and above the FOGMP corner frequency Δt/Tπ=0.06rad. This trend, which was also observed for the time-domain method, is consistent with snapshot overbounding where low-order parametric models of fat-tailed distributions are achievable at the cost of loose bounds of the distribution cores. Loose measurement error bounds can cause loose estimation error bounds, but they are needed to achieve high-integrity navigation using practical estimators such as KFs.

FIGURE 9

Contour plot showing the tightness of the CDF lower-bounding FOGMP model over the sample periodogram distribution

Positive values throughout indicate that the model is bounding at all frequencies and quantiles.

4 ANALYSIS OF TIME-CORRELATION MODELS USING SIMULATED DATA

The objective of this section is to illustrate the tightness of the bounding models as compared with known error statistics (e.g., for a FOGMP) and to demonstrate the applicability of the above procedures to non-FOGMP data sets. We use two simulated data sets to illustrate the method’s implementation (a) on a sparse data set and (b) on time-correlated non-FOGMP error data.

This section does not make any quantitative conclusions on the tightness of the error bounds, nor does it directly compare time- versus frequency-domain methods, because these conclusions depend on specific operational requirements such as availability performance in integrity monitoring functions. The impact of measurement error bound looseness on position-domain bounds is application-dependent: such analysis involves practical considerations that are beyond the scope of this paper (Joerger et al., 2023).

A comparison by Racelis et al. (2021) suggested that frequency-domain modeling can yield tighter positioning error bounds than time-domain modeling for a batch least-squares estimator.

4.1 Time-Correlation Modeling Using a Sparse Data Set

We can first assess the impact of data sparsity on bound tightness in the measurement domain using the example L = 2000 simulated FOGMPs of N = 100 samples each. Based on this same finite data set and using the methods in Sections 2 and 3, we achieve high-integrity FOGMP models with Tmin = 10 s, σmin = 0.96, Tmax = 90 s, and σmax = 1.05 in the time domain and with Tmax = 50 s and σmax = 1.3 in the frequency domain. If we increase L, the time constants and variance values would approach the simulated FOGMP parameters of T = 50 s and σv2=1.

For comparison with previous ACF bounding methods reported by Langel (2014), we reprocess the data by considering groups of 25 time series out of the original L = 2000, and we average their lagged products to generate 80 ACFs. The ACF upper bound has the following parameter values: Tmax = 100 s, σmax = 1.414, giving a looser bound than that obtained with the new lagged product method (Tmax = 90 s, σmax = 1.05); the ACF lower bounding parameters are undefined because sample ACFs take negative values. A major benefit of the new method is that one can provide Tmin and σmin values for any data set over any range of operational lag times τ0,τop. In parallel, for comparison with the PSD upper-bounding approach of Gallon et al. (2020) and Langel et al. (2020), we generate 80 PSDs by averaging five scaled periodograms over 500-s-long time series. The time series lengths had to be extended as compared to N = 100 to limit the looseness of the PSD bound. This data partitioning favors the baseline PSD approach, which would otherwise produce an unrealistically loose bound. The rationale for this process, which requires some background information on PSD estimation, is described in Appendix E. The resulting PSD bound gives Tmax = 50 s and σmax = 2.5, which is again looser than that obtained with the new periodogram-based approach (Tmax = 50 s, σmax = 1.3).

4.2 Time-Correlation Modeling of Non-FOGMP Data

The methods described in this paper are applicable not only to samples drawn from a single FOGMP, but also to data with an unknown time-correlation structure. To analyze this more general case, in this section, we simulate non-FOGMP data consisting of L = 2000 time series with a length of 100 s and a sampling interval Δt = 1 s, i.e., N = 100. The data set is built as a composite of two distinct unit-variance FOGMPs including 1000 sample time series with time constant TA = 50 s and 1000 time series with TB = 15 s. Thus, this data set is a mixture of two unit-variance random processes vA,n and vB,n with respective PDFs p(vA,n) and p(vB,n), which can be expressed as follows:

vn12pvA,n+12pvB,n24

where:

vA,n=expΔtTAvA,n1+ηA,n1,andvB,n=expΔtTBvB,n1+ηB,n125

with:

ηA,nN0,1exp2ΔtTAandηB,nN0,1exp2ΔtTB26

The statistics of this sparse non-FOGMP data set are modeled using FOGMPs in the time and frequency domains.

Using the time-domain procedure in Section 2.3, we found upper- and lower-bounding FOGMP models defined by Tmax = 85 s, σmax = 1.1 and Tmin = 10 s, σmax = 1, respectively. Using the frequency-domain procedure in Section 2.3, we found a PSD upper-bounding FOMGP model with Tmax = 40 s and σmax = 1.5. The tightness of the time-domain and frequency-domain bounding models is shown in Appendix C.

5 EXPERIMENTAL EVALUATION OF TIME-CORRELATION MODELS

In this section, the two time-correlation modeling methods are applied to experimental GPS L1-frequency pseudorange multipath data derived from IF CMC samples collected in a low multipath environment in Tucson, Arizona, USA (32°13’36” N 110°56’49” W), on March 3, 2018. The data were collected for 32 GPS satellites over 24 h with a 10° mask on the elevation angle, using a NovAtel ProPak6 GNSS receiver with a Vexxis GNSS-802 antenna. The receiver was mounted on the roof of a car parked on the top floor of a parking garage. The equipment and experimental setup are displayed in Figure 10, and the raw data are displayed in Figure 11.

FIGURE 10

Testbed overview: the receiver and antenna (top) are mounted on a parked car in an open-sky area (bottom).

FIGURE 11

IF CMC data over time with color-coded satellite data (left); IF CMC data versus satellite elevation angle (right) before and after normalization (top and bottom, respectively)

The IF CMC data are scaled to evaluate receiver noise and multipath and must be detrended to remove the elevation-angle dependence, which would otherwise cause the IF CMC time series to violate the WSS assumption of the modeling methods. The raw (and scaled) IF CMC data in the top right-hand-side panel of Figure 11 show a variance that changes with elevation angle. Therefore, an elevation-dependent variance model is used to normalize the IF CMC data. We use a modified version of the exponential multipath error variance model that we tune to this IF CMC data set (Working Group C - ARAIM Technical Subgroup, 2016). The normalizing standard deviation, in units of meters, is given by the following:

σnorm=1.102+1.638expθ2027

where θ is the satellite elevation angle in degrees. After normalization, the sample standard deviation approaches unity at all elevation angles, as shown in the bottom right-hand side in Figure 11. The normalized data are unitless.

5.1 TIME-DOMAIN METHOD

The normalized IF CMC data for all 32 satellites are sampled at regular intervals of Δt = 1 s and partitioned into L = 904 time series of N = 600 samples each. The data are first processed via the time-domain method to derive a model based on a pair of FOGMPs. The differences between sample data and bounding model CDFs are shown in Figure 12 for lag times of τ = 1 s to τ = 600 s and over all quantiles. The FOGMP time-correlation model parameters are Tmax = 1500 s, σmax = 1.3 and Tmin = 100 s, σmin = 0.975. For comparison, the ACF upper-bounding approach reported by Langel (2014) would give parameter values of Tmax = 1800 s, σmax = 1.9; the ACF lower bounding parameters over τop = 10 min are undefined because the ACFs take negative values (shown in Figure 20(a) in Appendix E).

FIGURE 12

Time-domain model: tightness of the (a) lower and (b) upper bounding FOGMP model CDF over the experimental data’s lagged product CDF

5.2 Frequency-Domain Method

The normalized IF CMC data are processed via the frequency-domain method with the same partitioning as in Section 5.1. The scaled periodograms are evaluated at circular frequencies ωnπ×104,π. The upper frequency limit is determined by the Nyquist frequency of 0.5 Hz for the 1-s sampling interval, which corresponds to a circular frequency of π rad. The lower limit should be significantly lower than 2πΔt(NΔt) to capture low-frequency content variations. For the 600-s-long time series data partition, the frequency limit should be lower than 10-3 rad, where the periodograms start flattening. The parameters of the bounding FOGMP time-correlation model are Tmax = 180 s and σmax = 1.35. Figure 13 presents the differences between the sample IF CMC and the model FOGMP scaled periodogram CDF surfaces. For comparison, using the same partition, the PSD upper-bounding approach reported by Gallon et al. (2020) and Langel et al. (2020) yields Tmax = 270 s and σmax = 2.2, corresponding to a looser bounding model than that obtained by using the new periodogram overbounding approach (shown in Figure 20(b) in Appendix E).

FIGURE 13

Frequency-domain model: tightness of the CDF lower-bounding FOGMP model over the experimental data’s periodogram distribution

6 CONCLUSIONS

In this paper, we developed and tested two new methods to determine high-integrity measurement error models from empirical data with an unknown time correlation. This paper employed FOGMPs as time-correlation models because they are routinely incorporated in linear recursive estimators for navigation applications.

Instead of ACF upper- and lower-bounding FOGMPs, the new time-domain method leverages a pair of CDF overbounds of lagged products. The resulting method is more widely applicable (including to large operational measurement filtering periods) and can more tightly bound the sample error data than previous ACF bounding approaches. Instead of PSD upper-bounding FOGMPs, the new frequency-domain method leverages a CDF overbound on scaled periodograms. The resulting method can more tightly bound the sample error data than previous PSD bounding approaches.

For performance evaluation, we used simulated data to show that the methods proposed herein can be used even for sparse data with non-FOGMP time correlation. The two methods were then tested using experimental GPS multipath error data and, in both cases, provided FOGMP models that were tighter than those obtained using previous methods.

HOW TO CITE THIS ARTICLE

Jada, S., & Joerger, M. (2025). Measurement error time-correlation modeling for safety-critical navigation. NAVIGATION, 72(4). https://doi.org/10.33012/navi.721

ACKNOWLEDGMENTS

The authors would like to thank the Federal Aviation Administration for their support of this research. However, the opinions expressed in this paper are our own and do not necessarily represent those of any other person or organization.

APPENDIX

A CDF DERIVATION OF FOGMP SCALED PERIODOGRAM

This appendix shows that, at a given frequency, a FOGMP scaled periodogram can be expressed as a linear combination of two independent one-degree-of-freedom chi-square random variables. This type of distribution corresponds to a generalized chi-square random variable, which can be evaluated using the algorithm from Davies (1980).

The FOGMP in Equation (5) can be expressed as follows:

vn=ρvn1+ηn128

where ρexpΔt/T. We can rewrite this recursive relationship as follows:

vnρnv0+j=0n1ρjηn1j29

where vn is expressed as a linear combination of independent Gaussian random variables v0 and ηj, for j = 0, …, n – 1. The DFT of the FOGMP time series vn for n = 0, …, N – 1 can be expressed as the following:

fω=n=0N1vnznwherezexpiω30

The DFT fω for a circular frequency ω, with ω0,π, is a sum of N complex-valued random numbers. Substituting Equation (29) into Equation (30) gives the following expression:

fωv0n=0N1ρnzn+n=1N1j=0n1ρjηn1jzn31

Collecting the coefficients for each independent random variable in Equation (31) (i.e., for each column in Table 1), we can rewrite fω as follows:

fωc0v0+c1η0+...+cnηn1+...+cN1ηN232

View this table:
TABLE 1

List of Terms in Equation (31)

where:

cnj=0N1nρjzj+n

Each complex coefficient cn can be rewritten using a geometric series formula:

cnzn1ρz1ρzNn33

We express the real part a and imaginary part b of fωfω=a+ib as follows:

a=Rec0v0+Rec1η0+Recnηn1+...+RecN1ηN2

b=Imc0v0+Imc1η0+Imcnηn1+...+ImcN1ηN2

We use vector notation to rewrite a and b as follows:

a=v0η0...ηN2Rec0Rec1RecN1,b=v0η0...ηN2Imc0Imc1ImcN134

We define the following N × 1 vector of real-valued, independently and identically distributed standard normal random variables:

xv0σvη0ση...ηN2σηT,xN0,IN35

where IN is the N × N identity matrix (we also have ση2=σv21ρ2). We rewrite Equation (34) in terms of x as follows:

a=xTRec0σvRec1σηRecN1ση,b=xTImc0σvImc1σηImcN1ση36

The periodogram pω can be expressed in terms of a and b as follows:

pω=fωfω¯=a2+b237

In terms of x, we obtain the following for Equation (37):

p(w)=[ab][ab]=xTΛTΛx 38

where:

ΛRe(c0)σvRe(c1)σηRe(cN1)σηIm(c0)σvIm(c1)σηIm(cN1)ση39

The N × N real, symmetric matrix ΛTΛ is of rank 2. Following the method used by Joerger and Pervan (2013), we can apply a singular value decomposition of ΛTΛ to rewrite pω as follows:

p(ω)=λ12y12+λ22y22wherey12χ2(1)andy22χ2(1) 40

where λ12 and λ22 are the two non-zero singular values of ΛTΛ. The scaled periodogram in Equation (18) is obtained by dividing both sides of Equation (40) by 1/πN.

Appendix

B PROOF THAT THE MEAN OF A CDF LOWER BOUND PROVIDES AN UPPER BOUND FOR THE MEAN OF THE SAMPLE DISTRIBUTION

This appendix aims at proving the theorem in Section 2.2. For an actual sample random variable A, we define the expected value as follows (Ross, 1995):

μAEA=xdFAx41

where FA(x) is the CDF of A. Let FL(x) be a lower-bounding CDF defined as follows:

FAxFLx,x,42

The two CDFs map real values x, to probability values P [0, 1]. Given a probability P0, we define xA and xL such that FAxA=FLxL=P0. Because the CDFs are monotonically increasing functions, we can write the following inequality:

xAPxLP,P0,143

The fact that the inequality in Equation (42) implies the inequality in Equation (43) is illustrated, for example, in Figure 8: for any given value of the scaled periodogram ‘x,’ the FOGMP CDF is lower than the sample CDF. Conversely, for any given probability, the scaled periodogram value of the lower-bounding CDF is higher than that of the sample CDF. Using Equation (43) and the property of definite integrals, we can write the following inequality:

01xAPdP01xLPdP44

Using the expected value definition in Equation (41), we obtain the following for Equation (44):

μAμL45

where µL is the expected value of the CDF FL(x). The same reasoning applies to CDF upper bounds. We obtain the following relationship:

FAxFUx,x,impliesμAμU46

where µu is the mean of the upper-bounding CDF Fu(x).

Appendix

C CONTOUR PLOTS OF SIMULATED AND EXPERIMENTAL MODEL TIGHTNESS

This appendix shows contour plots of the tightness of the bounding models for simulated non-FOGMP and experimental data. First, Figures 14 and 15 show the tightness of the time-domain and frequency-domain bounding models, respectively, for the simulated data described in Section 4.2.

FIGURE 14

Contour plots showing the color-coded difference between model CDF and simulated non-FOGMP sample CDF for the (a) lower-bounding FOGMP model CDF and (b) upper-bounding FOGMP model CDF Positive values throughout indicate that the models are bounding at all lag times and CDF quantiles.

FIGURE 15

Contour plot showing the tightness of the CDF lower-bounding FOGMP model over the simulated non-FOGMP sample periodogram distribution

Second, Figures 16 and 17 show the tightness of the time-domain and frequency-domain bounding models, respectively, for the experimental data used in Figures 12 and 13; however, in this case, the tightness is represented as a function of the lagged product and scaled periodogram, respectively, instead of as a function of quantile (y-axis). This alternative visualization helps identify regions of loose or tight bounds on more intuitive ACF-consistent and PSD-consistent representations.

FIGURE 16

Time-domain model: tightness of the (a) lower- and (b) upper-bounding FOGMP lagged product CDF versus the experimental data’s lagged product CDF, shown as a function of lagged products on the y-axis

FIGURE 17

Frequency-domain model: tightness of the CDF lower-bounding FOGMP model over the experimental data’s periodogram distribution, shown as a function of periodograms on the y-axis

Appendix

D CONVERGENCE OF NORMALIZED LAGGED PRODUCT PDF TOWARDS A ONE-DEGREE-OF-FREEDOM CHI-SQUARE PDF FOR SMALL LAGS

The PDF of the lagged product distribution is given by the following:

fq(τ)(x)=1πσv21α2exp(xασv2(1α2))K0(|x|σv2(1α2))withαexp(τT) 47

We define a normalized lagged productq˜τ as follows:

q˜τ=qτσv248

Because PDFs must integrate to unity, we can write the following scaling equivalence relation for the PDFs:

fq˜(τ)(x)=σv2fq(τ)(σv2x) 49

We write the PDF of the normalized lagged products using Equations (47) and (49) as follows (also derived by Nadarajah and Pogány (2016)):

fq˜(τ)(x)=1π1α2exp(xα1α2)K0(|x|1α2) 50

The value of the function K0 tends to zero and that of exp tends to infinity as τ approaches 0 α1, which leads to an indeterminate form in Equation (47). To evaluate this limit, we consider the following asymptotic expansion for large real-valued positive arguments of the modified Bessel function of the second kind (Abramowitz & Stegun, 1964):

Kϕ(ψ)π2ψexp(ψ)Φϕ(ψ) 51

where:

Φϕ(ψ)(1+μ18ψ+(μ1)(μ9)2!(8ψ)2+(μ1)(μ9)(μ25)3!(8ψ)3+)withμ(2ϕ)2 52

We can write the following approximation of the expansion in Equation (51):

K0x1α2π2x1α212expx1α2Φ0x1α253

Substituting the asymptotic expansion in Equation (53) into Equation (47), we obtain the following approximation of the lagged product PDF:

fq˜(τ)(x)12π|x|12exp(|x|αx(1α2))Φ0(|x|(1α2))54

As τ approaches 0 α1, the infinite seriesΦ0 converges to unity, and the normalized lagged product q˜τ tends to positive values. We assume that x0. At the limit, we can write the following equation:

limτ0fq˜(τ)(x)=12πx12exp(x2) 55

The limit is a single-degree-of-freedom chi-square distribution, which is expressed as follows:

fq˜0x=12πx12expx2 56

Using the scaling equivalence in Equation (49), we can write the lagged product PDF at τ=0 as follows:

fq0x=1σv2πx12expx2σv257

Appendix

E BENCHMARK ACF AND PSD BOUNDING METHODS

E.1 Data Partitioning

This appendix provides elements that guided our data partitioning to achieve a fair comparison between baseline ACF and PSD approaches versus lagged product and periodogram methods.

In this paper, to maintain consistency in the evaluation, ACF and PSD estimates are directly derived from averaged lagged products and periodograms. Other methods estimate ACFs and PSDs using overlapping windows, which could further obscure this comparison.

To avoid limiting the simulated data analysis in Section 4 to a specific application, we partitioned the data into time series of two times the first FOGMP’s time constant (two times 50 s in Section 4.1), a time beyond which the first and last samples could be considered uncorrelated. For a given application, we would have partitioned the data into time series with a length equal to the operational period. This partitioning was used for the lagged product, ACF, and periodogram-based approaches.

However, because of the averaging operation in PSD estimation, this partition would have been unfavorable for the PSD-based bound. For a finite overall number of samples partitioned into non-overlapping time series, we face the following trade-off: the larger the number of time series, L, the less noisy the PSD estimate. However, a larger number of time series corresponds to a shorter length of each time series, which can introduce spectral leakage and underestimated low-frequency content. This trade-off is illustrated in Figure 18 with an example periodogram-based PSD estimation process from a single set of 500,000 data samples partitioned in two different ways. In Figure 18(a), we process 100 times series of 5000 samples each (L = 100, N = 5000): the estimated PSD converges to the theoretical PSD, but the estimate is noisy because the periodograms are averaged over a relatively small set of 100 time series. In Figure 18(b), for L = 5000 and L = 100, the PSD estimate is less noisy, but it does not match the theoretical PSD at low frequencies, and it shows oscillations due to spectral leakage over the relatively small windows of N = 100 samples (corresponding to a window length of two times the FOGMP time constant when a length of 10 times the time constant would better match the theoretical curve). In a more recent paper, Joerger et al. (2023) showed that a PSD derived from a finite number N of FOGMP data samples can be expressed as follows:

s^ω=2σv2πReNN+1ρz+ρzN+1N1ρz2σv2π58

FIGURE 18

Impact of data partitioning on PSD estimation from a fixed amount of data of 500,000 samples: (a) L = 100 time series with a length of N = 5000 samples; (b) L = 5000 time series with a length of N = 100 samples

where pexpΔt/T. This theoretical PSD estimate, and therefore the sample estimate, varies significantly with N. When the number of samples N is relatively low, this estimate is inaccurate as compared with the FOGMP PSD model, which assumes infinite samples, and can be described as follows:

sω=σv2π1ρ21+ρ22ρcosω59

This point is illustrated in Figure 19, where PSD estimates for values of N = 100 and N = 500 are compared with the model FOGMP PSD, assuming an infinite-length time series, which is used by Gallon et al. (2022) and Langel et al. (2020, 2024).

FIGURE 19

Impact of time series length on PSD accuracy

The N = 500 curve corresponds to the case in which the data are partitioned into time series with a length of 10 times the time constant, corresponding to the value we selected for PSD estimation. This case provides a much tighter FOGMP bounding model than if we used the same partition as for the other approaches.

It is worth noting that to address this data partitioning challenge, a recent paper suggested using the FOGMP PSD in Equation (58) in the bounding process instead of using the more compact infinite-length FOGMP PSD equation (Crespillo et al., 2024).

Again, this paper applied the partitioning that would provide the most favorable results for the baseline ACF and PSD method, i.e., the tightest bound of the models to the data. The partitioning simplification brought about by the lagged product and periodogram approaches could be seen as an added benefit of these methods, but further analysis beyond the scope of this paper would be required to confirm this point.

E.2 Example Benchmark ACF and PSD Bounding for the Experimental Data Set

This section aims to illustrate our implementation of the ACF and PSD bounding processes for the experimental IF CMC data in Section 5. Complete descriptions of these methods have been given by Gallon et al. (2022) and Langel et al. (2020, 2024).

Figure 20 shows the FOGMP ACF and PSD bounds for the experimental data discussed in Section 5. ACF and PSD bounding methods are determined by the worst-case sample ACF or PSD at each lag time and circular frequency, respectively. The resulting bounds can be loose. In addition, Figure 20 shows negative-valued sample lagged products at lag times larger than 580 s; these samples cannot be lower-bounded by a FOGMP model. The looseness of the bounds and the fact that the ACF model may not bound all samples are elements that motivated this paper’s derivation of the lagged product and scaled periodogram methods.

FIGURE 20

Performance of the (a) ACF and (b) PSD bounding method applied to IF CMC data

Appendix

F EXAMPLE UNBIASED LINEAR SCALAR ESTIMATOR

This appendix provides an expression of the estimator coefficients a0 and aτ for a constant, scalar state x in Equation (1). We consider a batch measurement equation expressed as follows:

z0zτ=h0hτx+v0vτ60

The least-squares estimate of x is given by the following:

x^=h0hτh0hτ1h0hτz0zτ61

The estimation error of x is defined as ετ=x^x. With the use of Equation (61), the estimator coefficients in Equation (1) are given by the following:

a0=h0h02+hτ2andaτ=hτh02+hτ262

This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

REFERENCES

  1. Abramowitz, M., & Stegun, I. A. (1964). Handbook of mathematical functions with formulas, graphs, and mathematical tables (10th ed.). Dover.
  2. Blanch, J., Walter, T., & Enge, P. (2017). A MATLAB toolset to determine strict Gaussian bounding distributions of a sample distribution. Proc. of the 30th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2017), Portland, OR, 42364247. https://doi.org/10.33012/2017.15392
  3. Chatfield, C., & Xing, H. (2019). The analysis of time series: An introduction with R. CRC Press. https://doi.org/10.1201/9781351259446
  4. Crespillo, O. G., Joerger, M., & Langel, S. (2020). Overbounding GNSS/INS integration with uncertain GNSS Gauss-Markov error parameters. Proc. of the 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS), Portland, OR, 481489. https://doi.org/10.1109/PLANS46316.2020.9109874
  5. Crespillo, O. G., Langel, S., & Joerger, M. (2023). Tight bounds for uncertain time-correlated errors with Gauss-Markov structure in Kalman filtering. IEEE Transactions on Aerospace and Electronic Systems, 59(4), 43474362. https://doi.org/10.1109/TAES.2023.3242943
  6. Crespillo, O. G., Langel, S., & Joerger, M. (2024). Frequency domain overbounding with multiple time series and PSD estimators. Proc. of the 37th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2024), Baltimore, MD, 107113. https://doi.org/10.33012/2024.19704
  7. Cui, G., Yu, X., Iommelli, S., & Kong, L. (2016). Exact distribution for the product of two correlated Gaussian random variables. IEEE Signal Processing Letters, 23(11), 16621666. https://doi.org/10.1109/LSP.2016.2614539
  8. Davies, R. B. (1980). Algorithm as 155: The distribution of a linear combination of ✗2 random variables. Journal of the Royal Statistical Society. Series C (Applied Statistics), 29(3), 323333. https://doi.org/10.2307/2346911
  9. DeCleene, B. (2000). Defining pseudorange integrity - Overbounding. Proc. of the 13th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GPS 2000), Salt Lake City, UT, 19161924. https://www.ion.org/publications/abstract.cfm?articleID=1603
  10. Gallon, E., Joerger, M., Perea, S., & Pervan, B. (2019). Error model development for ARAIM exploiting satellite motion. Proc. of the 32nd International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2019), Miami, FL, 31623174. https://doi.org/10.33012/2019.17019
  11. Gallon, E., Joerger, M., & Pervan, B. (2020). Robust modeling of tropospheric delay dynamics for sequential positioning. Proc. of the 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS), Portland, OR, 239246. https://doi.org/10.1109/PLANS46316.2020.9109969
  12. Gallon, E., Joerger, M., & Pervan, B. (2021). Robust modeling of GNSS tropospheric delay dynamics. IEEE Transactions on Aerospace and Electronic Systems, 57(5), 29923003. https://doi.org/10.1109/TAES.2021.3068441
  13. Gallon, E., Joerger, M., & Pervan, B. (2022). Robust modeling of GNSS orbit and clock error dynamics. NAVIGATION, 69(4). https://doi.org/10.33012/navi.539
  14. Gallon, E., & Veiga, A. R. (2024). Performance assessment of fault free recursive SBAS users with high-integrity time correlated measurement error models. Proc. of the 37th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2024), Baltimore, MD, 180194. https://doi.org/10.33012/2024.19828
  15. Jada, S. K., & Joerger, M. (2020). GMP-overbound parameter determination for measurement error time correlation modeling. Proc. of the 2020 International Technical Meeting of the Institute of Navigation, San Diego, CA, 189206. https://doi.org/10.33012/2020.17137
  16. Joerger, M., Jada, S., Langel, S., Crespillo, O. G., Gallon, E., & Pervan, B. (2023). Practical considerations in PSD upper bounding of experimental data. Proc. of the 36th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2023), Denver, CO, 441448. https://doi.org/10.33012/2023.19196
  17. Joerger, M., & Pervan, B. (2013). Kalman filter-based integrity monitoring against sensor faults. Journal of Guidance, Control, and Dynamics, 36(2), 349361. https://doi.org/10.2514/1.59480
  18. Langel, S. (2014). Bounding estimation integrity risk for linear systems with structured stochastic modeling uncertainty [Doctoral dissertation, Illinois Institute of Technology]. http://hdl.handle.net/10560/3336
  19. Langel, S., Crespillo, O. G., & Joerger, M. (2024). Frequency-domain modeling of correlated Gaussian noise in Kalman filtering. IEEE Transactions on Aerospace and Electronic Systems, 114. https://doi.org/10.1109/TAES.2024.3442775
  20. Langel, S., Garcia Crespillo, O., & Joerger, M. (2019). Bounding sequential estimation errors due to Gauss-Markov noise with uncertain parameters. Proc. of the 32nd International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS+ 2019, Miami, FL, 30793098. https://doi.org/10.33012/2019.17014
  21. Langel, S., Garcia Crespillo, O., & Joerger, M. (2020). A new approach for modeling correlated Gaussian errors using frequency domain overbounding. Proc. of the 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS), Portland, OR, 868876. https://doi.org/10.1109/PLANS46316.2020.9110192
  22. Langel, S., Garcia Crespillo, O., & Joerger, M. (2021). Overbounding the effect of uncertain Gauss-Markov noise in Kalman filtering. NAVIGATION, 68(2), 259276. https://doi.org/10.1002/navi.419
  23. Maller, R. A., Muller, G., & Szimayer, A. (2009). Ornstein-Uhlenbeck processes and extensions. In T. Mikosch, J.-P. Kreis, R. A. Davis, & T. G. Andersen (Eds.), Handbook of financial time series (pp. 421437). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-71297-8_18
  24. Nadarajah, S., & Pogany, T. K. (2016). On the distribution of the product of correlated normal random variables. Comptes Rendus Mathematique, 354(2), 201204. https://doi.org/10.1016/j.crma.2015.10.019
  25. Perea, S. (2019). Design of an integrity support message for offline advanced RAIM [Doctoral dissertation, RWTH Aachen University]. https://doi.org/10.18154/RWTH-2019-05834
  26. Pervan, B., Khanafseh, S., & Patel, J. (2017). Test statistic auto- and cross-correlation effects on monitor false alert and missed detection probabilities. Proc. of the 2017 International Technical Meeting of the Institute of Navigation, Monterey, CA, 562590. https://doi.org/10.33012/2017.14874
  27. Racelis, D., Jada, S., & Joerger, M. (2021). Sequential ARAIM evaluation using time-domain versus frequency-domain errorcorrelation bounding methods. Proc. of the 34th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2021), St. Louis, MO, 10791091. https://doi.org/10.33012/2021.18037
  28. Rife, J., Pullen, S., Enge, P., & Pervan, B. (2006). Paired overbounding for nonideal LAAS and WAAS error distributions. IEEE Transactions on Aerospace and Electronic Systems, 42(4), 13861395. https://doi.org/10.1109/TAES.2006.314579
  29. RTCA Special Committee 159. (2001). Minimum operational performance standards for Global Positioning System/wide area augmentation system airborne equipment. Document No. RTCA/DO-229C. https://standards.globalspec.com/std/14281994/rtca-do-229
  30. RTCA Special Committee 159. (2004). Minimum aviation system performance standards for the local area augmentation system (LAAS). Document No. RTCA/DO-245. https://standards.globalspec.com/std/11988/rtca-do-245
  31. Working Group C - ARAIM Technical Subgroup. (2016). ARAIM Milestone 3 Report. Retrieved September 2020 from https://www.gps.gov/policy/cooperation/europe/2016/working-group-c/
Loading
Loading
Loading
Loading
  • Share
  • Bookmark this Article