Adaptive GNSS Positioning Method Capable of Adjusting to Ionospheric Delay

Information

  • Patent Application
  • 20180188378
  • Publication Number
    20180188378
  • Date Filed
    August 15, 2016
    8 years ago
  • Date Published
    July 05, 2018
    6 years ago
Abstract
A plurality of GNSS satellite signals feeds the signal processing engine operating in certain processing mode including carrier phase smoothed pseudorange positioning, precise point positioning (PPP), pseudorange differential (DGNSS), and carrier phase differential (RTK). The processing engine calculates two estimates of the ionosphere delay for each satellite: the filtered delay and the instant delay. Comparison of them allows to detect turbulent variation of the ionosphere and adjust parameters of two-parametric dynamic mode which improves positioning precision.
Description
BACKGROUND OF THE INVENTION
Field of the Invention

The present invention relates to a satellite navigation systems, and, more particularly, to more accurate determination of ionospheric delays in satellite navigation signals using an adjustable dynamic model.


Description of the Related Art

Assume that the receiver is capable of receiving multiple GNSS signals of multiple GNSS satellites, including (but not limited by this set)

    • GPS L1, L2, L5;
    • Galileo L1, L2, E5a, E5b;
    • QZSS L1, L2, L5, E6;
    • GLONASS L1, L2, L3;
    • BEIDOU B1, B2, B3.


The number of such signals can exceed several dozen. The following fundamental set of observables is used:











P

k
,
b

p



(
t
)


=



ρ
k
p



(
t
)


+


cdt
k



(
t
)


-


cdt
p



(
t
)


+


(


f

L





1

p


f
b
p


)




I

k
,

L





1


p



(
t
)



+


T
k
p



(
t
)


+

d

k
,
b
,
P


+

M

k
,
b
,
P

p

-

D

b
,
P

p

+


ɛ

k
,
b
,
P

p



(
t
)







(
1
)








ϕ

k
,
b

p



(
t
)


=




f
b
p

c




ρ
k
p



(
t
)



+


f
b
p



dt


(
t
)



-


f
b
p




dt
p



(
t
)



+


N

k
,
b

p



(

t

CS
,
k
,
b

p

)


-


1
c





(

f

L





1

p

)

2


f
b
p





I

k
,

L





1


p



(
t
)



+



f
b
p

c




T
k
p



(
t
)



+

d

k
,
b
,
ϕ

p

+

M

k
,
b
,
ϕ

p

-

D

b
,
ϕ

p

+

ɛ

k
,
b
,
ϕ

p






(
2
)







where the following notations are used (see [1, Chapter 6, 7]):

    • k is the index of the station;
    • p is the number of the satellite (out of K total satellites from which signals are received). It is assumed that all satellites available for tracking in the receiver station k are ordered and this ordering number includes the satellite system. For example, satellites with numbers from 1 to 5 are GPS, satellites with numbers from 6 to 11 are GLONASS, satellites with numbers from 12 to 15 are BEIDOU, etc.;
    • b is the frequency band (for example L1, LP2, L2C, L5, E6, B1, and so on);
    • (p,b) the pair of indices indicating the signal of the satellite p at the frequency band b;
    • t is the current time; the term ‘epoch’ is also used to denote the current discrete time instant;
    • c is the light speed;
    • fbp is the frequency of the signal corresponding to the satellite p and the frequency band b
    • dtk (t) is the current clock bias of the station k;
    • dtp(t) is the current clock bias of the satellite p;
    • Ik,bp(t) is the ionospheric delay affecting the signal (p,b) received by the station k. Thus Ik,L1p(t) is related to the L1 band. Basically, the ionospheric delay depends on the position of the station, position of the satellite, frequency of the signal, and the total electronic content (TEC) corresponding to the time instant t;
    • Tkp(t) is the tropospheric delay. In contrast to the ionospheric delay it doesn't depend on the signal frequency and is called ‘non-dispersive’ delay.
    • Pk,bp(t) and φk,bp(t) are pseudorange and phase measurements respectively;
    • Mk,b,Pp and Mk,b,φp are code and phase multipath, affecting pseudorange and carrier phase measurements respectively;
    • Nk,bp(tCS,k,bp) carrier phase ambiguity corresponding to the signal (p,b) received by the station k. Note that it corresponds to the last detected cycle slip and therefore it explicitly dependents on the time instant tCS,k,bp, when the cycle slip was detected. The carrier phase ambiguity remains unchanged until the cycle slip occurs.
    • ρkp(t) is the true topocentric range between the satellite and the receiver station. The measurement equations (1) and (2) relate this quantity with pseudorange and carrier phase observables, respectively;
    • Quantities Db,φp, Dn,Pp, εk,b,Pp(t) and εk,b,φp denote hardware biases and noise. D stands for satellite-related bias, while d denotes the receiver-related bias. Biases reflect a systematic hardware component of the measurement error. They are constant or slow varying, in contrast to the noise component of the error having the stochastic nature. Satellite position error is part of the slow varying bias. It is also called ‘the ephemerides’ error.


Thus, the receiver position is measured by the pseudorange and carrier phase observables for the plurality of satellites. Error components, including biases and noise, affecting the observable equations (1) and (2), prevent a direct solution for the receiver antenna position.


Carrier phase measurements are much more precise, compared to the pseudorange measurements, since the carrier phase noise has standard deviation in the centimeter or even millimeter range, while the standard deviation of the pseudorange measurements is usually of the meter or decimeter range. On the other hand, the carrier phase measurement is affected by the carrier phase ambiguity, which is an unknown integer valued quantity.


Thus, elimination of measurement errors is necessary for precise positioning. To achieve a high precision in position determination, different methods of errors mitigation are applied. For example, tropospheric errors can be precisely modeled and compensated in observables of equations (1) and (2). Ionospheric errors can be estimated along with other unknowns. Noise is easily filtered.


Errors common to two receivers, like clock and hardware biases of the satellite, can be compensated in a difference between two receivers. Usually one of receivers occupies a known position, while an antenna of another receiver is attached to the object to be located. The first receiver is called ‘the base’ while another receiver is called ‘the rover’. The processing mode involving calculation of the across-receiver difference (also called the ‘first difference’) is referred to as differential GNSS processing or DGNSS. The DGNSS processing is performed in real time and includes not only pseudoranges but also carrier phase observables, and is referred to as real time kinematic (RTK) processing.


Another sources of errors partially eliminated by across-receiver differences are ionospheric delay and ephemerides error. The closer the rover is to the base, the better is compensation of the ionospheric and ephemerides error.


For two stations k and l the across-receiver differences of pseudorange and carrier phase measurements can be written as













P
_


kl
,
b

p



(
t
)


=



ρ
k
p



(
t
)


-


ρ
l
p



(
t
)


+


cdt
kl



(
t
)


+



(


f

L





1

p


f
b
p


)

2




I

kl
,

L





1


p



(
t
)



+

d

kl
,
b
,
P


+



ɛ
_


kl
,
b
,
P

p



(
t
)




,




(
3
)










ϕ
_


kl
,
b

p



(
t
)


=



1

λ
b
p




(



ρ
k
p



(
t
)


-


ρ
l
p



(
t
)



)


+


f
b
p




dt
kl



(
t
)



+


N

kl
,
b

p



(

t

CS
,
kl
,
b

p

)


-


1

λ
b
p





(


f

L





1

p


f
b
p


)

2




I

kl
,

L





1


p



(
t
)



+

d

kl
,
b
,
ϕ

p

+


ɛ
_


kl
,
b
,
ϕ

p



,




(
4
)







Another way for error mitigation includes using a precise satellites clock and precise ephemerides. They are available through a dedicated real time service. Precise point positioning (PPP) allows to achieve the centimeter level position with only one rover receiver, provided satellite clock and precise satellite position are available. The base station is not necessary in this case.


Finally, if neither base station, nor precise clock and ephemerides are available, the quality of the standalone position can be improved if carrier phase ambiguity and ionospheric delay are estimated, along with position, using broadcast ephemerides. The corresponding processing mode is equivalent smoothing of pseudoranges using carrier phase measurements or, in short, carrier phase smoothing of code pseudoranges, see [2]. Whatever processing mode is used, the linearization and filtering algorithms are used for recursive estimation of unknown position, carrier phase ambiguity, and ionospheric delay.


The general form of the linearized navigation model has the following form (see [1, Chapt. 7])






b
P(t)=Adx(t)+eξ(t)+Γi(t)+dP  (5)






b
φ(t)=Λ−1Adx(t)+Λ−1eξ(t)+n−Λ−1Γi(t)+dφ  (6)


Two last quantities are undifferences for carrier phase smoothing and PPP processing modes. For DGNSS and RTK processing modes the carrier phase ambiguity and ionospheric delay are across-receiver differenced.


Let n be total number of satellite signals, including different satellite systems, different satellites, different frequency bands.


In the following description, all vectors are represented by columns, and the superscript symbol T denotes the matrix transpose. RN is the N-dimensional Euclidean space. Given a linearization point x0(t)∈R3, notations used in equations (5) and (6) are as follows:

    • bP(t)∈Rn is the n-dimensional vector of pseudorange residuals calculated at the linearization point;
    • bφ(t)∈Rn is the n-dimensional vector of carrier phase residuals calculated at the linearization point;
    • e=(1, 1, . . . , 1)T∈Rn is the vector consisting of all “ones”;
    • dx(t)∈R3 is the correction to the linearization point. Thus, the corrected position is calculated as x(t)=x0(t)+dx(t);
    • ξ(t) is the arbitrary varying rover clock shift; it is undifferenced for the standalone and PPP processing modes, and it is across-receiver differenced in the DGNSS and RTK processing modes;
    • Λ is the n-dimensional diagonal matrix with wavelengths λbp=c/fbp in the main diagonal. Each wavelength corresponds to the specific signal (p,b);
    • A is the n×3 matrix of directional cosines;
    • Γ is the n×n diagonal matrix with quantities (fL1p/fbp)2 in the main diagonal;
    • i(t)∈Rn is the vector of ionospheric delays related to the L1 frequency band. Ionospheric delays are undifferenced for the standalone and PPP processing modes, and they are across-receiver differenced in the DGNSS and RTK processing modes;
    • n∈Rn is the vector of carrier phase ambiguities related to the L1 frequency band. Ambiguities are undifferenced for the standalone and PPP processing modes, and they are across-receiver differenced in the DGNSS and RTK processing modes;
    • dP∈Rn and dφ∈Rn are vectors of pseudorange and carrier phase receiver hardware biases.


Consideration of pseudorange hardware biases leads to a necessity to consider the plurality of signals the receiver is able to track. In the case of a multi-frequency and multi-system receiver supporting the following bands:


L1, L2 and L5 bands for GPS,


L1 and L2 GLONASS,


L1, E5a, E5b and E6 Galileo,


L1, L2, L5 and E6 QZSS,


L1 an, L5 SBAS,


B1, B2, and B3 Beidou,


the signals (L1 GPS, L1 Galileo, L1 SBAS, L1 QZSS), (L2 GPS, L2 QZSS), (L5 GPS, E5a Galileo, L5 SBAS, L5 QZSS), (E6 Galileo, E6 QZSS), respectively, can share the same hardware channel and therefore will be affected by the same hardware bias, as noted in [1, Chapter 7]. Note that the biases vector dP and the clock shift variable ξ(t) appear as a sum in equation (5). This means that one of the biases, say dL1,G/E/S/Q,P, can be combined with ξ(t), while others can be replaced with their difference with dL1,G/E/S/Q,P . Thus, new bias variables appear:





η1=dL2,G/Q,P−dL1,G/E/S/Q,P2=dL1,R,P−dL1,G/E/S/Q,P3=dL2,R,P−dL1,G/E/S/Q,P





η4=dL5,G/E/S/Q,P−dL1,G/E/S/Q,P5=dE5b,E,P−dL1,G/E/S/Q,P6=dE6,E/Q,P−dL1,G/E/S/Q,P





η7=dB1,B,P−dL1,G/E/S/Q,P8=dB2,B,P−dL1,G/E/S/Q,P9=dB3,B,P−dL1,G/E/S/Q,P  (7)


This representation can be referred to as establishing a bias datum.


In one possible embodiment, the linearized equations (5) can now be expressed in the form






b
p(t)=Adx(t)+eξ(t)+Γi(t)+Wηη  (8)


The bias vector η has the appropriate dimension mη. Note again that in this exemplary embodiment we follow notations introduced in [1], which is incorporated herein by reference in its entirety.


The bias vector η is three-dimensional (mη=3) for dual-band and dual-system GPS/GLONASS receivers, as only biases η1, η2, η3 are presented among all possible biases listed in (7). In the case of the multi-band, multi-system receiver, the dimension of the vector η can be large. It is one-dimensional in the case of dual-band GPS-only receivers or single band GPS/GLONASS receivers.


The Wη is referred to as bias allocation matrix and has dimensions n×mη. It allocates a single bias, or none, to a certain signal. No bias is allocated to the signal corresponding to the GPS, Galileo, SBAS, or QZSS systems and b=L1 because we combined the bias dL1,G/E/S/Q,P with the clock bias ξ(t). In this case, the row of Wη consists of zeroes.


Consider, for example, a dual-band GPS/GLONASS receiver. Suppose it tracks six GPS satellites and six GLONASS satellites. The total number of dual-band signals is 24. Let the signals be ordered in the following way: six GPS L1, six GPS L2, six GLONASS L1, and six GLONASS L2 signals. The biases allocation matrix presented in the linearized single difference pseudorange equation (8) takes the following form:


Further, the real-valued carrier phase ambiguities (also called float ambiguities) are combined with biases dφ), while pseudorange biases are considered as a real valued constant unknown parameter. Thus, after combination of carrier phase ambiguities with carrier phase biases, the equation (6) takes the form






b
φ(t)=Γ−1Adx(t)+Γ−1eξ(t)+n−Λ−1Γi(t)  (10)


Note that the noise component is omitted in equations (8), (10) for the sake of brevity.


Accordingly, there is a need in the art for a more accurate determination of phase to, thereby, enable more accurate determination of position.


SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to automatic adjusting of parameters of the ionosphere dynamic model to the current state of the ionosphere in order to achieve better precision of positioning in the following processing modes:


Standalone with carrier phase smoothing of pseudoranges,


PPP,


DGNSS,


RTK.


The same ionosphere delay and carrier phase ambiguity described above is used in all processing modes. Adaptive adjustment of parameters is performed after the recursive update step according to the equation (19) (described in the following text) is performed.


Additional features and advantages of the invention will be set forth in the description that follows, and in part will be apparent from the description, or may be learned by practice of the invention. The advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.


It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.





BRIEF DESCRIPTION OF THE ATTACHED FIGURES

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention.


In the drawings:



FIG. 1 illustrates constellation of GNSS satellites, the GNSS antenna and receiver, and signals travelling from satellites to the antenna through the ionospheric layer.



FIG. 2 illustrates algorithm of the adaptation of the time constant τi. and the scale factor s.



FIG. 3 illustrates an exemplary navigation receiver on which the invention may be implemented.





DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings.


The vector of ionospheric delays i(t) is supposed to be slow varying. Its time variation is subjected to a certain dynamic model. To specify the dynamic model that governs variation of i(t) let us suppose that time variation of the vector i(t) is restricted by equations






i
p(t)=γiip(t−1)+εi(t)  (11)


where










γ
i

=

e

-


Δ





t


τ
i








(
12
)







with Δt being the across-epoch time difference, and τi being the time constant reflecting the rate of variation of the ionospheric delay in time. A typical value for τi is 600-1800 seconds, provided no ionospheric disturbances and scintillation occurs. Otherwise, if detection criteria described below indicate a presence of fast variation of ionosphere (more precisely, a variation of content of charged particles, or total electron content (TEC) in the ionosphere), the instant value of τi can be temporary scaled down until the fast variations end. Moreover, the algorithm presented here is able to adaptively adjust the constant τi to the rate of real variation of the ionosphere state.


The white noise εt (t) has a variance σi2 which provides the variance of the resulting ionosphere delay generated by the difference equation (11). For the case of RTK and DGNSS processing modes the resulting residual across-receiver delay is supposed to satisfy the condition





ip(t)|≈10−6×∥baselinele length∥  (13)


with a certain scale factor s, which takes values of, for example, from 1 to 5, depending on the current solar activity (for a period with unusually high solar activity, a value of s up to 10 might be used). For the standalone and PPP processing modes it should satisfy the condition





ip(t)|≈s×σref  (14)


where σref is a certain reference value corresponding to the averaged state of the ionosphere, s is a scale factor having the same meaning as in (13).


It follows from (11) that ∥ip(t)∥2=∥γiip(t−1)+εi(t)∥2. Then, assuming that the stochastic process ip(t) is stationary and ip(t) does not depend on εi(t), we take a mean value of both sides of the last equality. We obtain





σi2=(1−γi2)×(10−6×∥baseline length∥)2  (15)





or





σi2=(1−γi2)×(s×σref)2  (16)


depending on the processing mode. Having in mind application of the filtering scheme for estimation of variables listed in equations (8) and (10), let us define the measurement and dynamic models. The measurement model combines equations (8) and (10). The group of variables η and η form the vector









y
=

(



η




n



)





(
17
)







The group of arbitrary varying variables dx(t) and ξ(t) form the vector











x
_



(
t
)


=

(




dx


(
t
)







ξ


(
t
)





)





(
18
)







The group of slow varying variables is arranged into the vector i(t) governed by the dynamic model (11). Then the estimation algorithm described in [1, Table 3.5.1 and Chapt. 7.6, 7.7] can be applied.


Taking into account notations (17) and (18) the recursive estimation algorithm takes the following form










(




i


(

t
+
1

)







y


(

t
+
1

)





)

=


(





γ
i



i


(
t
)








y


(
t
)





)

+


G
iy




r




(

t
+
1

)








(
19
)








x
_



(

t
+
1

)


=



G
x



(

t
+
1

)





r




(

t
+
1

)







(
20
)







with Giy and Gx being the matrix gain, r′(t+1) and r″(t+1) being the residuals of the linearized measurement equations (8) and (10) calculated before and after the update (19). The matrix gain is calculated according to the algorithm described in [1, Chapters 7.6, 7.7]. We present the full description here for the sake of completeness:










G
iy

=



(

M
T

)


-
1





M

-
1




(




H
T






W
T




)



Π





(
21
)







G
x

=



(

L
J
T

)


-
1





(

L
J

)


-
1




J
T






(
22
)







where:




embedded image




    • JTJ=LJLJT, calculation of the Cholesky factorization;

    • Π=I2n−J(LJT)−1(LJ)−1JT;







embedded image


In is the identity matrix, 0 is the zero matrix of the appropriate size;




embedded image




    • F=γiIn;

    • Q=σi2 In;





To complete description, let us introduce the recursive scheme with the matrix {circumflex over (D)}(t)∈RK+ny being recursively updated, {circumflex over (D)}(0)=0, ny is dimension of the vector y,




embedded image


Last equation (26) defines the Cholesky factorization. Finally.






{circumflex over (D)}(t+1)=MMT  (27)


The matrix M is used in equation (21).


Let us define also the filtering reset procedure. If for any reason the ‘filtering reset’ decision is taken at the time instant t+1, the matrix {circumflex over (D)}(t) is set to zero:






{circumflex over (D)}(t):=0  (28)


which means that the filtering scheme is started from the scratch at the time instant t+1.


Let us define also the partial filtering reset procedure with the fading factor α<1. It means that the memory accumulated in the matrix {circumflex over (D)}(t) is partially ‘forgotten’:






{circumflex over (D)}(t):=α{circumflex over (D)}(t)  (29)


It should be noted that for the sake of brevity we omitted handling of covariance matrices of the pseudorange and carrier phase noise. Moreover, we omitted this noise component in the basic equations (5) and (6).


The main problem with application of this straightforward numerical scheme is that the two parameters τi and s presented in the in equations (11), (12), and (13), reflecting the current state of the ionosphere, are usually unknown. Moreover, the dynamic model (11) is applicable to the stationary, time invariant, “calm” state of the ionosphere. In practice, the ionosphere is subject to turbulence, which makes the model (11) with constant parameters τi and s inapplicable. The current invention deals with the adaptive algorithm being able to adjust variation of the model parameters to the time varying state of the ionosphere.


Assuming that constant parameters (17) are updated at the time instant t+1 by the recursive scheme (19), the current estimate of the ambiguity vector n(t+1) is available. Assuming that the number of satellites K is not less than 4, the number of frequency bands is not less than 2, and the number of signals n is not less than 8, the equation (10) can be solved with respect to the variables dx(t+1), ξ(t+1), i(t+1). Let us denote these instant estimates by dx*(t+1), ξ*(t+1), i*(t+1). Then:










(





dx
*



(

t
+
1

)








ξ
*



(

t
+
1

)








i
*



(

t
+
1

)





)

=



(



A
_

T



A
_


)


-
1






A
_

T



(



b
ϕ



(

t
+
1

)


-

n


(

t
+
1

)



)







(
30
)







where






Ā=[Λ
−1
A|Λ
−1
e|−Λ
Γ]  (31)


Thus two estimates of the ionosphere delay vector i are available at the time instant t+1:

    • The filtered estimate i(t+1) calculated through the update equation (19) taking into account the dynamic model (11) with parameters τi and s;
    • The instant estimate i*(t+1) calculated based on instant carrier phase measurements and instant carrier phase ambiguity estimate n(t+1), not taking into account the dynamic model (11).


Comparison of these two estimates allows to judge whether the ionosphere model with currently used parameters τi and s is applicable. One of the criteria proposed in this discussion indicates that the parameter τi should be downscaled. Another criterion indicates that the parameter s should be increased or decreased.


A large body of literature is devoted to detection of fast variation of the ionospheric delays, mainly in connection with scintillation detection. The standard approach consists of analysis of time series for each satellites individually. Two criteria S4 and σφ (amplitude and phase scintillation indices, respectively) are used. Various decision rules, like Neyman-Pearson (see [2] and references cited therein) can be applied to generate binary criteria.


A well known approach to mitigation of the ionosphere delay consists in construction of the ionosphere-free combination (IFC) of pseudorange and carrier phase measurements (see for example [1]). An advantage of using IFC is that it allows for almost total rejection of the ionosphere delay. A disadvantage is that it does not take into account slow varying nature of the ionosphere delay. Moreover, using IFC increases sensitivity of the resulting position to the measurement's noise and errors of another nature. The method of adjusting parameters of IFC is considered in [3].


The approach described in the present discussion does not use time-series analysis for each satellite individually. Instead, it uses the criteria in which all satellites are involved simultaneously. It can be stated that the current invention uses the state space domain analysis instead of time domain analysis, allowing for instant detection of ionospheric turbulence. For the case of calm ionosphere, it allows to produce less noisy position, compared to IFC-based approaches. For the time varying turbulent ionosphere, it allows to adjust parameters of the dynamic model (11).



FIG. 2 shows detailed flow chart of the proposed algorithm of adaptive adjustment of parameters τi and s. After filtering (see block 201), the instant ionospheric delay is calculated (see block 202). Having at hand two estimates i(t+1) and i*(t+1), the correlation coefficient between them is calculated as (see block 203):










c


(

t
+
1

)


=





i


(

t
+
1

)


,


i
*



(

t
+
1

)









i


(

t
+
1

)









i
*



(

t
+
1

)










(
32
)







where custom-charactera, bcustom-character denotes the scalar product of the two vectors a and b; ∥a∥ denotes the Euclidean norm of the vector a. Both vectors i(t+1) and i*(t+1) have the dimension K, i.e., the number of satellites.


A high correlation between two estimates (see block 208) means that the parameter τi is most likely chosen correctly and there is no need to change it (see block 209). Otherwise, a low value of the correlation coefficient c(t+1) (less than the threshold value TT) shows that τi should be decreased (see block 204) allowing the value i(t+1) to change faster. Let Sdown<1 be the downscaling factor. In one embodiment Tl can be chosen 0.9 (for example) and Sdown can be chosen 0.9 (for example). Then the parameter τi is updated





τi:=τi×Sdown  (33)


Moreover, the filtering algorithm (19), (21)-(27) (see block 201) can be totally or partially reset according to equations (28) or (29) with α<1 being the parameter of the algorithm. In one embodiment α can be chosen α=0.1. The total reset is a particular case of (29) with α=0.


In the case of the partial reset, the current estimate i(t+1) is updated (see block 204) according to the equation






i(t+1):=αi(t+1)+(1−α)i*(t+1)  (34)


If c(t+1) is above the upper threshold value Tu (0<Tl<Tu<1) then τi should be increased. Let Sup>1 be the magnification factor. In one embodiment Tu can be chosen 0.99 and Sup=1.1. The parameter τi is updated (see block 205) according to





τi:=min {τi×Sup,τ*}  (35)


with updated value not exceeding the pre-defined value τ* which can be chosen as 1200 seconds (for example).


If Tl<c(t+1)<Tu then τi is kept unchanged.


Even if the correlation is good, the values ∥i*(t+1)∥ and ∥i(t+1)∥ are not necessary nearly equal. If, for example (see block 210), the inequality





i*(t+1)∥>∥i(t+1)∥  (36)


holds for several sequential time instances (say, 5), then the value of s should be increased (see block 206):






S:=s×S
up  (37)


Otherwise (see block 211), if the inequality





i*(t+1)∥<∥i(t+1)∥  (38)


holds for several sequential time instances (say, 5), then the value of s should be decreased (see block 207):






s:=s×S
down  (39)


The values of Sup and Sdown can be chosen 1.1 and 0.9, respectively.



FIG. 3 illustrates an exemplary navigation receiver on which the invention may be implemented. As will be appreciated by one of ordinary skill in the art, the various blocks and components shown in FIG. 3 can be implemented as discrete components, as an ASIC or multiple ASICs or as software running on a processor.


Having thus described the different embodiments of a system and method, it should be apparent to those skilled in the art that certain advantages of the described method and apparatus have been achieved. It should also be appreciated that various modifications, adaptations, and alternative embodiments thereof may be made within the scope and spirit of the present invention. The invention is further defined by the following claims.


REFERENCES (INCORPORATED HEREIN BY REFERENCE IN THEIR ENTIRETY)



  • 1. A. Leick, L. Rapoport, D. Tatarnikov, GPS Satellite Surveying, Wiley & Sons (2015)

  • 2. D. V. Ratnam, G. Sivavaraprasad, J. Lee, Automatic ionospheric scintillation detector for global navigation satellite system receivers, IET Radar, Sonar & navigation, DOI: 10.1049/iet-rsn.2014.0232 (February 2015).

  • 3. S.V. Averin, R.A. Nevzorov, A.V. Plenkin, V.I. Zubinsky, Mitigation of scintillations in signals of global navigation satellite systems caused by ionospheric irregularities, U.S. Pat. No. 9,244,174, issued Jan. 26, 2016.


Claims
  • 1. A satellite navigation positioning method, comprising: receiving n navigation signals from K navigation satellites, wherein the n navigation signals are on at least two different carrier frequencies, and wherein n is at least 8 and K is at least 4;on a processor of a navigation receiver, calculating current coordinates based on the n navigation signals;executing an adaptive positioning algorithm for adjusting parameter z representing a time constant of a rate of variation of ionospheric delay, and a scale factors, which ranges from 1 to 10 and which relates to a baseline length and solar activity; andcorrecting the calculated current coordinates based on the adaptive positioning algorithm.
  • 2. The method of claim 1, further comprising calculating a filtered estimate i(t+1) using parameters τi and s;
  • 3. The method of claim 2, further comprising calculating an instant estimate i*(t+1) calculated based on instant carrier phase measurements and instant carrier phase ambiguity estimate.
  • 4. The method of claim 2, further comprising calculating a correlation coefficient
  • 5. The method of claim 3, further comprising reducing τi if the correlation coefficient is less than a threshold value Tl.
  • 6. The method of claim 3, further comprising increasing τi if the correlation coefficient is greater than a threshold value Tl.
  • 7. The method of claim 1, further comprising increasing s if ∥i*(t+1)∥>∥(t+1)∥is true for several sequential time instances.
  • 8. The method of claim 1, further comprising decreasing s if ∥i*(t+1)∥<∥i(t+1)∥is true for several sequential time instances.
PCT Information
Filing Document Filing Date Country Kind
PCT/RU2016/000544 8/15/2016 WO 00