# Patent

## Title
GNSS signal processing to estimate MW biases

## Abstract

Methods and apparatus are described for processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising: forming an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch, and estimating from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
The following are related hereto and incorporated herein in their entirety by this reference: U.S. patent application Ser. No. 12/660,091 filed 20 Feb. 2010; U.S. patent application Ser. No. 12/660,080 filed 20 Feb. 2010; U.S. Provisional Application for Patent No. 61/277,184 filed 19 Sep. 2009; International Patent Application PCT/US2009/059552 filed 5 Oct. 2009, published as WO 2010/042441 on 15 Apr. 2010; U.S. Provisional Application for Patent No. 61/195,276 filed 6 Oct. 2008; International Patent Application PCT/US/2009/004471 filed 5 Aug. 2009, published as WO 2010/021656 on 25 Feb. 2010; International Patent Application PCT/US/2009/004473 filed 5 Aug. 2009, published as WO 2010/021658 on 25 Feb. 2010; International Patent Application PCT/US/2009/004474 filed 5 Aug. 2009, published as WO 2010/021659 on 25 Feb. 2010; International Patent Application PCT/US/2009/004472 filed 5 August 2009, published as WO 2010/021657 on 25 Feb. 2010; International Patent Application PCT/US/2009/004476 filed 5 Aug. 2009 published as WO 2010/021660 A3 on 25 Feb. 2010; U.S. Provisional Application for Patent No. 61/189,382 filed 19 Aug. 2008; U.S. Pat. No. 7,576,690 issued 18 Aug. 2009; U.S. patent application Ser. No. 12/451,513 filed 22 June 2007, published as US 2010/0141515 on 10 Jun. 2010; U.S. Pat. No. 7,755,542 issued 13 Jul. 2010; International Patent Application PCT/US07/05874 filed 7 Mar. 2007, published as WO 2008/008099 on 17 Jan. 2008; U.S. patent application Ser. No. 11/988,763 filed 14 Jan. 2008, published as US 2009/0224969 A1 on 10 Sep. 2009; International Patent Application No. PCT/US/2006/034433 filed 5 Sep. 2006, published as WO 2007/032947 on 22 Mar. 2007; U.S. Pat. No. 7,432,853 granted 7 Oct. 2008; International Patent Application No. PCT/US2004/035263 filed 22 Oct. 2004, published as WO 2005/045463 on 19 May 2005; U.S. Pat. No. 6,862,526 granted 1 Mar. 2005. Priority benefit of U.S. Provisional Application for Patent No. 61/277,184 filed 19 Sep. 2009 is hereby claimed.


BACKGROUND
The invention relates to GNSS signal processing, and particularly to GNSS signal processing involving precise satellite data.
BRIEF SUMMARY
Methods and apparatus are described for processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising: forming an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch, and estimating from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.
In some embodiments, corrections are applied to the GNSS signal data. In some embodiments, at least one linear combination of GNSS signal data is smoothed before estimating an MW bias per satellite. In some embodiments, at least one MW bias constraint is applied. In some embodiments, at least one integer WL ambiguity constraint is applied. In some embodiments, a spanning tree (ST) is used over one of an observation graph and a filter graph for constraining the WL ambiguities. In some embodiments, a minimum spanning tree (MST) is used on one of an observation graph and a filter graph for constraining the WL ambiguities.
In some embodiments, the minimum spanning tree is based on edge weights, each edge weight derived from receiver-satellite geometry. In some embodiments, the edge weight is defined with respect to one of (i) a geometric distance from receiver to satellite, (ii) a satellite elevation angle, and (iii) a geometric distance from satellite to receiver to satellite, and (iv) a combination of the elevations under which the two satellites in a single differenced combination are seen at a station. In some embodiments, the minimum spanning tree is based on edge weights, with each edge weight based on WL ambiguity information, defined with respect to one of (i) difference of a WL ambiguity to integer, (ii) WL ambiguity variance, and (iii) a combination of (i) and (ii).
In some embodiments, at least one of the WL ambiguities is fixed as an integer value. In some embodiments, candidate sets of WL integer ambiguity values are determined, a weighted combination of the candidate sets is formed, and at least one of the WL ambiguities is fixed as a value taken from the weighted combination. In some embodiments, the estimating step comprises introducing fixed WL ambiguities so as to estimate MW biases which are compatible with fixed WL ambiguities. In some embodiments, the estimating step comprises applying an iterative filter to the MW data per epoch and wherein introducing fixed WL ambiguities comprises one of (i) putting the fixed WL ambiguities as observations into the filter, (ii) putting the fixed WL ambiguities as observations into a copy of the filter generated after each of a plurality of observation updates, and (iii) reducing the MW combinations by the fixed WL ambiguities and putting the resulting reduced MW combinations into a second filter without ambiguity states to estimate at least one MW bias per satellite.
In some embodiments, at least one MW bias is shifted by an integer number of WL cycles. In some embodiments, at least one MW bias and its respective WL ambiguity are shifted by an integer number of WL cycles. In some embodiments, the navigation message comprises orbit information.
Some embodiments provide apparatus for performing one or more of the described methods. Some embodiments provide a computer program comprising instructions configured, when executed on a computer processing unit, to carry out one or more of the described methods. Some embodiments provide a tangible computer-readable medium embodying such a computer program.



BRIEF DESCRIPTION OF DRAWINGS
These and other aspects and features of the present invention will be more readily understood from the embodiments described below with reference to the drawings, in which:
FIG. 1 shows a high-level view of a system in accordance with some embodiments of the invention;
FIG. 2 shows a high-level view of a system and system data in accordance with some embodiments of the invention;
FIG. 3 is a schematic diagram of network processor architecture in accordance with some embodiments of the invention;
FIG. 4 is a schematic diagram of data correction in accordance with some embodiments of the invention;
FIG. 5 is a schematic view of linear combinations of observations in accordance with some embodiments of the invention;
FIG. 6 is a schematic view of a generic Kalman filter process;
FIG. 7 is a schematic diagram of a code-leveled clock processor in accordance with some embodiments of the invention;
FIG. 8 is a schematic diagram of a Melbourne-Wübbena bias process flow in accordance with some embodiments of the invention;
FIG. 9 is a schematic diagram of a Melbourne-Wübbena bias process flow in accordance with some embodiments of the invention;
FIG. 10A shows filter states of an undifferenced Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 10B shows filter states of a single-differenced Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 11 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 12 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 13 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 14 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 15 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 16A is an observation graph of GNSS stations and satellites;
FIG. 16B is an abstract graph showing stations and satellites as vertices and station-satellite observations as edges;
FIG. 16C depicts a minimum spanning tree of the graph of FIG. 19B;
FIG. 16D depicts a minimum spanning tree with constrained edges;
FIG. 16E is an undifferenced observation graph of GNSS stations and satellites;
FIG. 16F is an filter graph corresponding to the observation graph of FIG. 19E;
FIG. 16G is a single-differenced observation graph of GNSS stations and satellites;
FIG. 16H is a filter graph corresponding to the observation graph of FIG. 19G;
FIG. 16I is a set of observations graphs comparing constraints in undifferenced and single-differenced processing;
FIG. 17 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 18A shows a spanning tree on an undifferenced observation graph;
FIG. 18B shows a minimum spanning tree on an undifferenced observation graph;
FIG. 18C shows a spanning tree on a single-differenced observation graph;
FIG. 18D shows a minimum spanning tree on a single-differenced observation graph;
FIG. 19 is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 20A is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 20B is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 21A is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 21B is a schematic diagram of a Melbourne-Wübbena filtering process in accordance with some embodiments of the invention;
FIG. 21C is a schematic diagram of a Melbourne-Wübbena filtering process in accordance with some embodiments of the invention;
FIG. 21D is a schematic diagram of a Melbourne-Wübbena filtering process in accordance with some embodiments of the invention;
FIG. 22A is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 22B illustrates the effect of shifting biases in accordance with some embodiments of the invention;
FIG. 22C is a schematic diagram of a Melbourne-Wübbena bias processor in accordance with some embodiments of the invention;
FIG. 23A is a schematic diagram of the startup of an orbit processor in accordance with some embodiments of the invention;
FIG. 23B is a schematic diagram of an orbit processor in accordance with some embodiments of the invention;
FIG. 23C is a schematic diagram of an orbit mapper of an orbit processor in accordance with some embodiments of the invention;
FIG. 23D is a schematic diagram of an orbit mapper of an orbit processor in accordance with some embodiments of the invention;
FIG. 24 is a timing diagram of code-leveled clock processing in accordance with some embodiments of the invention;
FIG. 25A is a schematic diagram of a high-rate code-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 25B is a schematic diagram of a high-rate code-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 25C is a schematic diagram of a high-rate code-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 26 is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 27A is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 27B is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 27C is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 28 is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 29 is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 30 is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 31 is a schematic diagram of a high-rate phase-leveled satellite clock processor in accordance with some embodiments of the invention;
FIG. 32 is a schematic diagram of a network processor computer system in accordance with some embodiments of the invention;
FIG. 33 is a simplified schematic diagram of an integrated GNSS receiver system in accordance with some embodiments of the invention;
FIG. 34 is a schematic diagram of a GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 35 depicts observation clock prediction in accordance with some embodiments of the invention;
FIG. 36 is a schematic diagram of a process for generating synthesized base station data in accordance with some embodiments of the invention;
FIG. 37 is a schematic diagram of an alternate GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 38 is a simplified schematic diagram of a GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 39 is a timing diagram of a low-latency GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 40 is a timing diagram of a high-accuracy GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 41 is a schematic diagram of an alternate GNSS rover process with synthesized base station data in accordance with some embodiments of the invention;
FIG. 42 depicts performance of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention in relation to a GNSS rover process without ambiguity fixing;
FIG. 43 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 44 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 45 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 46 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 47 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 48 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 49 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 50 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 51 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 52 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 53 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 54 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 55 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention;
FIG. 56 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention; and
FIG. 57 is a schematic diagram of a GNSS rover process with ambiguity fixing in accordance with some embodiments of the invention.



DETAILED DESCRIPTION
Part 1: System Overview
Global Navigation Satellite Systems (GNSS) include GPS, Galileo, Glonass, Compass and other similar positioning systems. While the examples given here are directed to GPS processing the principles are applicable to any such positioning system.
Definition of Real time: In this document the term “Real time” is mentioned several times. In the scope of the inventions covered by the following embodiments this term means that there is an action (e.g., data is processed, results are computed) as soon the required information for that action is available. Therefore, certain latency exists, and it depends on different aspects depending on the component of the system. The required information for the application covered in this document is usually GNSS data, and/or GNSS corrections, as described below.
The network processors running in real time are able to provide results for one epoch of data from a network of monitoring receivers after: (1a) The data is collected by each of the monitoring receivers (typically less than 1 msec); (1b) The data is transmitted from each receiver to the processing center (typically less than 2 sec); (1c) The data is processed by the processor. The computation of the results by the network processors typically takes between 0.5 and 5 seconds depending on the processor type, and amount of data to be used.
It is usual that data that do not follow certain restrictions in transmission delay (e.g., 3 sec) are rejected or buffered and therefore not immediately used for the current epoch update. This avoids the enlargement of the latency of the system in case one or more stations are transmitting data with an unacceptable amount of delay.
A rover receiver running in real time is able to provide results for one epoch of data after the data is collected by receiver (typically less than 1 msec) and: (2a) The correction data is generated by the processing center (see 1a, 1b, 1c); (2b) The correction data (if required) is received from the processing center (typically less than 5 sec); (2c) The data is processed (typically less than 1 msec).
To avoid or minimize the effect of data latency caused by (2a) and (2b), a delta phase approach can be used so updated receiver positions can be computed (typically in less than 1 msec) immediately after the data is collected and with correction data streams. The delta phase approach is described for example in U.S. Pat. No. 7,576,690 granted Aug. 18, 2009 to U. Vollath.
FIG. 1 and FIG. 2 show high level views of a system 100 in accordance with some embodiments of the invention. Reference stations of a worldwide tracking network, such as reference stations 105, 110, . . . 115, are distributed about the Earth. The position of each reference station is known very precisely, e.g., within less than 2 cm. Each reference station is equipped with an antenna and tracks the GNSS signals transmitted by the satellites in view at that station, such as GNS satellites 120, 125, . . . 130. The GNSS signals have codes modulated on each of two or more carrier frequencies. Each reference station acquires GNSS data 205 representing, for each satellite in view at each epoch, carrier-phase (carrier) observations 210 of at least two carriers, and pseudorange (code) observations 215 of the respective codes modulated on at least two carriers. The reference stations also obtain the almanac and ephemerides 220 of the satellites from the satellite signals. The almanac contains the rough position of all satellites of the GNSS, while the so-called broadcast ephemerides provide more precise predictions (ca. 1 m) of the satellites' positions and the satellites' clock error (ca. 1.5 m) over specific time intervals.
GNSS data collected at the reference stations is transmitted via communications channels 135 to a network processor 140. Network processor 140 uses the GNSS data from the reference stations with other information to generate a correction message containing precise satellite position and clock data, as detailed below. The correction message is transmitted for use by any number of GNSS rover receivers. The correction message is transmitted as shown in FIG. 1 via an uplink 150 and communications satellite 155 for broadcast over a wide area; any other suitable transmission medium may be used including but not limited to radio broadcast or mobile telephone link. Rover 160 is example of a GNSS rover receiver having a GNSS antenna 165 for receiving and tracking the signals of GNSS satellites in view at its location, and optionally having a communications antenna 170. Depending on the transmission band of the correction message, it can be received by rover 160 via GNSS antenna 165 or communications antenna 170.
Part 2: Network Architecture
FIG. 3 is a schematic diagram showing principal components of the process flow 300 of a network processor 140 in accordance with some embodiments of the invention. GNSS data from the global network of reference stations is supplied without corrections as GNSS data 305 or after correction by an optional data corrector 310 as corrected GNSS data 315, to four processors: a standard clock processor 320, a Melbourne-Wübbena (MW) bias processor 325, an orbit processor 330, and a phase clock processor 335.
Data corrector 310 optionally analyzes the raw GNSS data 305 from each reference station to check for quality of the received observations and, where possible, to correct the data for cycle slips, which are jumps in the carrier-phase observations occurring, e.g., each time the receiver has a loss of lock. Commercially-available reference stations typically detect cycle slips and flag the data accordingly. Cycle slip detection and correction techniques are summarized, for example, in G. Seeber, SATELLITE GEODESY, 2nd Ed. (2003) at pages 277-281. Data corrector 310 optionally applies other corrections. Though not all corrections are needed for all the processors, they do no harm if applied to the data. For example as described below some processors use a linear combination of code and carrier observations in which some uncorrected errors are canceled in forming the combinations.
Observations are acquired epoch by epoch at each reference station and transmitted with time tags to the network processor 140. For some stations the observations arrive delayed. This delay can range between milliseconds and minutes. Therefore an optional synchronizer 318 collects the data of the corrected reference station data within a predefined time span and passes the observations for each epoch as a set to the processor. This allows data arriving with a reasonable delay to be included in an epoch of data.
The MW bias processor 325 takes either uncorrected GNSS data 305 or corrected GNSS data 315 as input, since it uses the Melbourne-Wübbena linear combination which cancels out all but the ambiguities and the biases of the phase and code observations. Thus only receiver and satellite antenna corrections are important for the widelane processor 325. Based on this linear combination, one MW bias per satellite and one widelane ambiguity per receiver-satellite pairing are computed. The biases are smooth (not noisy) and exhibit only some sub-daily low-rate variations. The widelane ambiguities are constant and can be used as long as no cycle slip occurs in the observations on the respective satellite-receiver link. Thus the bias estimation is not very time critical and can be run, e.g., with a 15 minute update rate. This is advantageous because the computation time grows with the third power of the number of stations and satellites. As an example, the computation time for a reasonable network with 80 stations can be about 15 seconds. The values of fixed widelane ambiguities 340 and/or widelane biases 345 are optionally used in the orbit processor 330 and/or the phase clock processor 335, and/or are supplied to a scheduler 355. MW bias processor 325 is described in detail in Part 7 below.
Some embodiments of orbit processor 330 are based on a prediction-correction strategy. Using a precise force model and starting with an initial guess of the unknown values of the satellite's parameters (initial position, initial velocity and dynamic force model parameters), the orbit of each satellite is predicted by integration of the satellite's nonlinear dynamic system. The sensitivity matrix containing the partial derivatives of the current position to the unknown parameters is computed at the same time. Sensitivities of the initial satellite state are computed at the same time for the whole prediction. That is, starting with a prediction for the unknown parameters, the differential equation system is solved, integrating the orbit to the current time or into the future. This prediction can be linearized into the direction of the unknown parameters. Thus the partial derivatives (sensitivities) serve as a measure of the size of the change in the current satellite states if the unknown parameters are changed, or vice versa.
In some embodiments these partial derivatives are used in a Kalman filter to improve the initial guess by projecting the GNSS observations to the satellite's unknown parameters. This precise initial state estimate is used to again integrate the satellite's dynamic system and determine a precise orbit. A time update of the initial satellite state to the current epoch is performed from time to time. In some embodiments, ionospheric-free ambiguities are also states of the Kalman filter. The fixed widelane ambiguity values 340 are used to fix the ionospheric-free ambiguities of the orbit processor 330 to enhance the accuracy of the estimated orbits. A satellite orbit is very smooth and can be predicted for minutes and hours. The precise orbit predictions 350 are optionally forwarded to the standard clock processor 320 and to the phase clock processor 335 as well as to a scheduler 355.
Ultra-rapid orbits 360, such as IGU orbits provided by the International GNSS Service (IGS), can be used as an alternative to the precise orbit predictions 355. The IGU orbits are updated four times a day and are available with a three hour delay.
Standard clock processor 320 computes code-leveled satellite clocks 360 (also called standard satellite clocks), using GNSS data 305 or corrected GNSS data 315 and using precise orbit predictions 355 or ultra-rapid orbits 365. Code-leveled means that the clocks are sufficient for use with ionospheric-free code observations, but not with carrier-phase observations, because the code-leveled clocks do not preserve the integer nature of the ambiguities. The code-leveled clocks 360 computed by standard clock processor 320 represent clock-error differences between satellites. The standard clock processor 320 uses the clock errors of the broadcast ephemerides as pseudo observations and steers the estimated clocks to GPS time so that they can be used to compute, e.g., the exact time of transmission of a satellite's signal. The clock errors change rapidly, but for the use with code measurements, which are quite noisy, an accuracy of some centimeter is enough. Thus a “low rate” update rate of 30 seconds to 60 seconds is adequate. This is advantageous because computation time grows with the third power of number of stations and satellites. The standard clock processor 325 also determines troposphere zenith delays 365 as a byproduct of the estimation process. The troposphere zenith delays and the code-leveled clocks are sent to the phase clock processor 335. Standard clock processor 320 is described in detail in Part 6 below.
The phase clock processor 335 optionally uses the fixed widelane ambiguities 340 and/or MW biases 345 from widelane processor 325 together with the troposphere zenith delays 365 and the precise orbits 350 or IGU orbits 360 to estimate single-differenced clock errors and narrowlane ambiguities for each pairing of satellites. The single-differenced clock errors and narrowlane ambiguities are combined to obtain single-differenced phase-leveled clock errors 370 for each satellite (except for a reference satellite) which are single-differenced relative to the reference satellite. The low-rate code leveled clocks 360, the troposphere zenith delays 365 and the precise orbits 350 or IGU orbits 360 are used to estimate high-rate code-leveled clocks 375. Here, the computational effort is linear with the number of stations and to the third power with the number of satellites. The rapidly-changing phase-leveled clocks 370 and code-leveled clocks 375 are available, for example, with a delay of 0.1 sec-0.2 sec. The high-rate phase-leveled clocks 370 and the high-rate code-leveled clocks 375 are sent to the scheduler 355 together with the MW biases 340. Phase clock processor 340 is described in detail in Part 9 below.
Scheduler 355 receives the orbits (precise orbits 350 or IGU orbits 360), the MW biases 340, the high-rate phase-leveled clocks 370 and the high-rate code-leveled clock 375. Scheduler 355 packs these together and forwards the packed orbits and clocks and biases 380 to a message encoder 385 which prepares a correction message 390 in compressed format for transmission to the rover. Transmission to a rover takes for example about 10 sec-20 sec over a satellite link, but can also be done using a mobile phone or a direct Internet connection or other suitable communication link.
Part 3: Observation Data Corrector
FIG. 4 is a schematic diagram of data correction in accordance with some embodiments of the invention. Optional observation corrector 310 corrects the GNSS signals collected at a reference station for displacements of the station due to centrifugal, gyroscopic and gravitational forces acting on the Earth, the location of the station's antenna phase center relative to the station's antenna mounting point, the location of the satellite's antenna phase center relative to the satellite's center of mass given by the satellite's orbit, and variations of those phase centers depending on the alignment of the station's antenna and the satellite's antenna.
The main contributors to station displacements are solid Earth tides up to 500 mm, ocean tidal loadings up to 100 mm, and pole tides up to 10 mm. All of these depend on where the station is located. More description is found in McCarthy, D. D., Petit, G. (eds.), IERS Conventions (2003), IERS Technical Note No. 32, and references cited therein.
Ocean tides caused by the forces of astronomical bodies—mainly the moon—acting on the Earth's loose masses, also cause the Earth's tectonic plates to be lifted and lowered. This well-known effect shows up as recurring variations of the reference stations' locations. The solid Earth tides are optionally computed for network processing as well as for rover processing, as the effect should not be neglected and the computational effort is minor.
The second largest effect is the deformation of the Earth's tectonic plates due to the load of the oceans varying over time with the tides. Ocean tide loading parameters used to quickly compute the displacement of a station over time depend on the location of the station. The computational effort to derive these parameters is quite high. They can be computed for a given location, using any of the well-known models available at the online ocean-tide-loading service provided by the Onsala Space Observatory Ocean, http://www.oso.chalmers.se/ ̃loading/, Chalmers: Onsala Space Observatory, 2009. The lower accuracy parameters, e.g., from interpolation of a precomputed grid, are sufficient for the applications discussed here.
The smallest effect mentioned here is that due to pole tides. This displacement is due to the lift of a tectonic plate caused by the centrifugal and gyroscopic effects generated by the polar motion of the Earth. Earth orientation parameters are used for this computation. These are updated regularly at the International Earth Rotation & Reference System Service, International Earth Rotation & Reference System Service, http://hpiers.obspm.fr/, L′Observatoire de Paris, 2009, and are not easily computed. This minor effect is therefore optionally neglected in the rover processing.
Absolute calibrated antenna models are used to compute the offsets and variations of receiver and satellite antenna phase centers. A description is found at J. Kouba, A Guide to Using International GPS Service (IGS) Products, Geoodetic Survey Division Natural Resources Canada, February 2003. Calibration data collected by the IGS is made available in antex files at http://igscb.ipl.nasa.gov/, 2009; satellite antenna offset information is found for example in the IGS absolute antenna file igs05.atx.
Another effect is the antenna phase wind-up. If a receiver antenna is moving relative to the sender antenna the recorded data shows a phase shift. If this effect is neglected, a full turn of the satellite around the sending axis will cause an error of one cycle in the carrier-phase detected at the receiver. Since the satellite's orientation relative to the receiver is well known most of the time, this effect can be modeled as described in Wu J. T., Hajj G. A., Bertiger W. I., & Lichten S. M., Effects of antenna orientation on GPS carrier phase, MANUSCRIPTA GEODAETICA, Vol. 18, pp. 91-98 (1993).
The relative movement of the station and the satellite is mainly due to the orbiting satellite. If a satellite is eclipsing—this means the satellites orbit crosses the Earth's shadow—additional turns of the satellite around its sending axis are possible. For example, GPS Block IIA satellites have a noon turn and a shadow crossing maneuver, while GPS Block IIR satellites have a noon turn and a midnight turn. If the sun, the Earth and the satellite are nearly collinear it is hard to compute the direction of the turn maneuvers, and an incorrect direction will cause an error in the carrier-phase of one cycle. The satellite's yaw attitude influences the phase wind-up and the satellite antenna corrections. More detailed descriptions are found in Kouba, J., A simplified yaw-attitude model for eclipsing GPS satellites, GPS SOLUTIONS (2008) and Bar-Sever, Y. E., A new model for GPS yaw attitude, JOURNAL OF GEODESY, Vol. 70, pp. 714-723 (1996).
In the case of only using phase observations, the effect of an unmodeled satellite turn maneuver can not be separated from the satellite clock. Thus in a phase clock error estimation the effect of the turn maneuver is included in the estimated satellite clock error. If a rover uses those clocks it must not correct for satellite turn maneuver either.
The sun position is needed to compute the satellite's body-fixed coordinate frame, since the x axis is defined by the cross product of the satellite's position and the sun's position. This coordinate system is used to compute the yaw attitude, the satellite's antenna correction (offset and variations, mapped into sine of sight) and the phase wind-up correction. The moon's position is also needed for the solid Earth tides. How to compute the position of the sun and the moon is found, for example, in Seidelmann, P. K. (ed.), Explanatory Supplement to the Astronomical Almanac, University Science Books, U.S. (1992).
Further corrections can also be applied, though these are of only minor interest for the positioning accuracy level demanded by the marketplace.
Additional effects as corrections for relativistic effects, ionospheric and troposphere delays do not need to be considered in the optional data corrector 310. Relativistic corrections are usually applied to the satellite clocks. The major first order effect due to the ionosphere is eliminated using an ionospheric free combination of the GNSS observations, and the effect due to the troposphere is in some embodiments partly modeled and partly estimated.
Part 4: Forming Linear Combinations
4.1 Basic Modeling Equations
For code Pi,kmj and carrier phase Φi,kmj observations between receiver i and satellite j on frequency band k and modulation type m the following observation model is assumed that relates the observations to certain physical quantities,

Pi,kmj=ρij+cΔti−cΔtj+Tij+IP,i,kj+bP,i,km−bP,kmj+mP,i,kmj+εP,i,kmj.  (1)

Φi,kmj=ρij+cΔti−cΔtj+Tij+IΦ,i,kj+bΦ,i,k−bΦ,kj+λkNi,kj+mΦ,i,kmj+εΦ,i,kmj.  (2)

with

    ρij geometrical range from satellite j to receiver i
    c speed of light
    Δti receiver i clock error
    Δtj satellite j clock error
    Tij tropospheric delay from satellite j to receiver i






  
    I
    
      P
      ,
      i
      ,
      k
    
    j
  
  =
  
    
      
        I
        
          1
          ⁢
          i
        
        j
      
      
        f
        k
        2
      
    
    +
    
      
        2
        ⁢
        
          I
          
            2
            ⁢
            i
          
          j
        
      
      
        f
        k
        3
      
    
    +
    
      
        3
        ⁢
        
          I
          
            3
            ⁢
            i
          
          j
        
      
      
        f
        k
        4
      
    
  




    code ionospheric delay on frequency fk






  
    I
    
      Φ
      ,
      i
      ,
      k
    
    j
  
  =
  
    
      -
      
        
          I
          
            1
            ⁢
            i
          
          j
        
        
          f
          k
          2
        
      
    
    -
    
      
        I
        
          2
          ⁢
          i
        
        j
      
      
        f
        k
        3
      
    
    -
    
      
        I
        
          3
          ⁢
          i
        
        j
      
      
        f
        k
        4
      
    
  




    carrier phase ionospheric delay on frequency fk 
    bP,i,km code receiver bias
    bP,kmj code satellite bias
    bΦi,k phase receiver bias (independent of modulation type m)
    bΦ,kj phase satellite bias (independent of modulation type m)
    Ni,kj integer ambiguity term from satellite j to receiver i on wavelength λk 
    mP,i,kmj code multipath from satellite j to receiver i
    mΦ,i,kmj phase multipath from satellite j to receiver i
    εP,i,kmj code random noise term
    εΦ,i,kmj phase random noise term

The modulation type dependency in the phase observation can be suppressed by assuming that the different phase signals on a frequency band are already shifted to a common base inside the receiver, e.g. L2C is assumed to be shifted by −0.25 cycles to compensate the 90 degrees rotation of the quadrature phase on which it is modulated. However, noise and multipath terms (that are usually not modeled) still have a different contribution to the phase observation for different modulation types.



Examples of different modulation types (also called code types) are in case of GPS L1C/A, L1P, L1C on L1-frequency band and L2C, L2P on L2-frequency band and in case of Glonass L1C/A, L1P and L2C/A, L2P. For the Glonass satellite system, wavelength λk and frequency fk also depend on a satellite specific frequency channel number so that the notation could be extended to λk(j) and fk(j). In addition, especially the code receiver biases bP,i,km also have a channel and therefore satellite dependency (as can be seen in a zero-baseline processing with some averaging over time so that Pi1i2,kmj=bP,i,kmj). Therefore a more precise formulation for the code receiver bias would be bP,i,kmj=bP,i,km+ΔbP,i,kmj.
The symbol Φ used here for carrier phase observations, is also used for the time transition matrix in the Kalman filter context. For both cases, Φ is the standard symbol used in the scientific literature and we adopted this notation. The meaning of Φ will be always clear from the context.
In the following we neglect the second order




  
    I
    
      2
      ⁢
      
        
      
      ⁢
      i
    
    j
  
  
    f
    k
    3
  




and third order





  
    I
    
      3
      ⁢
      
        
      
      ⁢
      i
    
    j
  
  
    f
    k
    4
  




ionospheric terms that are typically in the range of less than 2 cm (Morton, van Graas, Zhou, & Herdtner, 2008), (Datta-Barua, Walter, Blanch, & Enge, 2007). In this way,





  
    I
    
      P
      ,
      i
      ,
      k
    
    j
  
  =
  
    
      
        I
        i
        j
      
      
        f
        k
        2
      
    
    =
    
      -
      
        I
        
          Φ
          ,
          i
          ,
          k
        
        j
      
    
  




with Iij:=I1ij. Only under very severe geomagnetic active conditions the second and third order terms can reach tens of centimeters. However, these conditions occur only for a few days in many years. The higher order ionospheric terms can be taken into account by ionospheric models based on the Appleton-Hartree equation that relates the phase index of refraction of a right hand circularly polarized wave propagating through the ionosphere to the wave frequency fk, the electron density and the earth magnetic field. Approximations to the Appleton-Hartree equation allow to relate the parameters I2ij, I3ij of the second and third order ionospheric terms to the first order ionospheric estimation parameter Iij:=I1ij that is a measure of the total electron content along the signal propagation path. Thus higher order ionospheric terms can be corrected on base of observation data on at least two frequencies.

In the following we will often talk about ionospheric-free (IF) linear combinations. However, notice that these linear combinations only cancel the first order ionospheric term and are thus not completely ionospheric-free.
Linear Combinations of Observations
By combining several code Pi,kmj and carrier phase Φi,kmj observations in a linear way




  
    
      
        
          LC
          =
          
            
              
                ∑
                
                  i
                  ,
                  j
                  ,
                  k
                  ,
                  m
                
              
              ⁢
              
                
                  a
                  
                    P
                    ,
                    i
                    ,
                    km
                  
                  j
                
                ⁢
                
                  P
                  
                    i
                    ,
                    km
                  
                  j
                
              
            
            +
            
              
                a
                
                  Φ
                  ,
                  i
                  ,
                  km
                
                j
              
              ⁢
              
                Φ
                
                  i
                  ,
                  km
                
                j
              
              ⁢
              
                
              
              ⁢
              with
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            a
            
              P
              ,
              i
              ,
              km
            
            j
          
          ,
          
            
              a
              
                Φ
                ,
                i
                ,
                km
              
              j
            
            ∈
            
              R
              ⁢
              
                
              
              ⁢
              for
              ⁢
              
                
              
              ⁢
              all
              ⁢
              
                
              
              ⁢
              i
            
          
          ,
          j
          ,
          k
          ,
          m
        
      
    
    
      
        (
        3
        )
      
    
  




some of the physical quantities can be eliminated from the linear combination LC so that these quantities do not have to be estimated if the linear combination is used as the observation input for an estimator. In this way some linear combinations are of special importance.

Single difference (SD) observations between two satellites j1 and j2 eliminate all quantities that are not satellite dependent, i.e. that do not have a satellite index j.
Defining Xj1j2:=Xj2−Xj1, the between satellite SD observations are formally obtained by substituting each index j by j1j2 and ignoring all terms without a satellite index j

Pi,kmj1j2=ρij1j2−cΔtj1j2+Tij1j2+IP,i,kj1j2−bP,kmj1j2+mP,i,kmj1j2+εP,i,kmj1j2.  (4)

Φi,kmj1j2=ρij1j2−cΔtj1j2+Tij1j2+IΦ,i,kj1j2−bΦ,kmj1j2+mΦ,i,kmj1j2+εΦ,i,kmj1j2.  (5)

In this way the receiver clock and receiver bias terms have been eliminated in the linear combination.

In the same way single difference observations between two receivers i1 and i2 eliminate all quantities that are not receiver dependent, i.e. that have no receiver index i.
By generating the difference between two receivers i, and i2 on the between satellite single difference observations (4) and (5), double difference (DD) observations are obtained that also eliminate all receiver dependent terms from (4) and (5).
Defining Xi1i2j1j2:=Xi2j1j2−Xi1j1j2=(Xi2j2−Xi2j1)−(Xi1j2−Xi1j1), the DD observations are formally obtained from (4) and (5) by substituting each index i by i1i2 and ignoring all terms without a receiver index i

Pi1i2,kmj1j2=ρi1i2j1j2+Ti1i2j1j2+IP,i1i2,kj1j2+mP,i1i2,kmj1j2+εP,i1i2,kmj1j2.  (6)

Φi1i2,kmj1j2=ρi1i2j1j2+Ti1i2j1j2+IΦ,i1i2,kj1j2+λkNi1i2,kj1j2+mΦ,i1i2,kmj1j2+εΦ,i1i2,kmj1j2.  (7)

In this way also the satellite clock and the satellite biases have been eliminated in the linear combination.

In the following we assume that all code observations Pi,kmj correspond to the same modulation type and that all phase observations Φi,kmj correspond to the same observation type that may differ from the modulation type of the code observations. Since the modulation type dependency for the phase observations occurs only in the unmodeled multipath and random noise terms, in this way the modulation type index m can be suppressed.
For our purposes two linear combinations that cancel the first order ionospheric delay




  
    I
    i
    j
  
  
    f
    k
    2
  




in different ways are of special importance, the iono-free linear combination for code and carrier phase and the Melbourne-Wübbena (MW) linear combination Φi,WLj−Pi,NLj consisting of the widelane (WL) carrier phase





  
    
      Φ
      
        i
        ,
        WL
      
      j
    
    
      λ
      WL
    
  
  :=
  
    
      
        Φ
        
          i
          ,
          1
        
        j
      
      
        λ
        1
      
    
    -
    
      
        Φ
        
          i
          ,
          2
        
        j
      
      
        λ
        2
      
    
  




and narrowlane (NL) code





  
    
      P
      
        i
        ,
        NL
      
      j
    
    
      λ
      NL
    
  
  :=
  
    
      
        P
        
          i
          ,
          1
        
        j
      
      
        λ
        1
      
    
    +
    
      
        P
        
          i
          ,
          2
        
        j
      
      
        λ
        2
      
    
  




observations with wavelengths





  
    λ
    WL
  
  =
  
    
      c
      
        f
        WL
      
    
    :=
    
      c
      
        
          f
          1
        
        -
        
          f
          2
        
      
    
  




and





  
    
      λ
      NL
    
    =
    
      
        c
        
          f
          NL
        
      
      :=
      
        c
        
          
            f
            1
          
          +
          
            f
            2
          
        
      
    
  
  ,




(Melbourne, 1985), (Wübbena, 1985),





  
    
      
        
          P
          
            i
            ,
            NL
          
          j
        
        =
        
          
            ρ
            i
            j
          
          +
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              i
            
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              i
            
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              j
            
          
          +
          
            T
            i
            j
          
          +
          
            
              λ
              NL
            
            ⁡
            
              (
              
                
                  
                    b
                    
                      P
                      ,
                      i
                      ,
                      1
                    
                  
                  
                    λ
                    1
                  
                
                +
                
                  
                    b
                    
                      P
                      ,
                      i
                      ,
                      2
                    
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
          -
          
            
              λ
              NL
            
            ⁡
            
              (
              
                
                  
                    b
                    
                      P
                      ,
                      1
                    
                    j
                  
                  
                    λ
                    1
                  
                
                +
                
                  
                    b
                    
                      P
                      ,
                      2
                    
                    j
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
          +
          
            
              λ
              NL
            
            ⁡
            
              (
              
                
                  
                    I
                    i
                    j
                  
                  
                    
                      λ
                      1
                    
                    ⁢
                    
                      f
                      1
                      2
                    
                  
                
                +
                
                  
                    I
                    i
                    j
                  
                  
                    
                      λ
                      2
                    
                    ⁢
                    
                      f
                      2
                      2
                    
                  
                
              
              )
            
          
          +
          
            
              λ
              NL
            
            ⁡
            
              (
              
                
                  
                    
                      m
                      
                        P
                        ,
                        i
                        ,
                        1
                      
                      j
                    
                    +
                    
                      ɛ
                      
                        P
                        ,
                        i
                        ,
                        1
                      
                      j
                    
                  
                  
                    λ
                    1
                  
                
                +
                
                  
                    
                      m
                      
                        P
                        ,
                        i
                        ,
                        2
                      
                      j
                    
                    +
                    
                      ɛ
                      
                        P
                        ,
                        i
                        ,
                        2
                      
                      j
                    
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
        
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          Φ
          
            i
            ,
            WL
          
          j
        
        =
        
          
            ρ
            i
            j
          
          +
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              i
            
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              j
            
          
          +
          
            T
            i
            j
          
          +
          
            
              λ
              WL
            
            ⁡
            
              (
              
                
                  
                    b
                    
                      Φ
                      ,
                      i
                      ,
                      1
                    
                  
                  
                    λ
                    1
                  
                
                -
                
                  
                    b
                    
                      Φ
                      ,
                      i
                      ,
                      2
                    
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
          -
          
            
              λ
              WL
            
            ⁡
            
              (
              
                
                  
                    b
                    
                      Φ
                      ,
                      1
                    
                    j
                  
                  
                    λ
                    1
                  
                
                -
                
                  
                    b
                    
                      Φ
                      ,
                      2
                    
                    j
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
          -
          
            
              λ
              WL
            
            ⁡
            
              (
              
                
                  
                    I
                    i
                    j
                  
                  
                    
                      λ
                      1
                    
                    ⁢
                    
                      f
                      1
                      2
                    
                  
                
                -
                
                  
                    I
                    i
                    j
                  
                  
                    
                      λ
                      2
                    
                    ⁢
                    
                      f
                      2
                      2
                    
                  
                
              
              )
            
          
          +
          
            
              λ
              WL
            
            ⁢
            
              
                (
                
                  
                    N
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    j
                  
                  -
                  
                    N
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                    j
                  
                
                )
              
              
                }
                
                  =
                  
                    :
                    
                      N
                      
                        i
                        ,
                        WL
                      
                      j
                    
                  
                
              
            
          
          +
          
            
              λ
              WL
            
            ⁡
            
              (
              
                
                  
                    
                      m
                      
                        Φ
                        ,
                        i
                        ,
                        1
                      
                      j
                    
                    +
                    
                      ɛ
                      
                        Φ
                        ,
                        i
                        ,
                        1
                      
                      j
                    
                  
                  
                    λ
                    1
                  
                
                -
                
                  
                    
                      m
                      
                        Φ
                        ,
                        i
                        ,
                        2
                      
                      j
                    
                    +
                    
                      ɛ
                      
                        Φ
                        ,
                        i
                        ,
                        2
                      
                      j
                    
                  
                  
                    λ
                    2
                  
                
              
              )
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




so that





  
    
      
        
          
            
              
                
                  Φ
                  
                    i
                    ,
                    WL
                  
                  j
                
                -
                
                  P
                  
                    i
                    ,
                    NL
                  
                  j
                
              
              =
              
              ⁢
              
                
                  
                    
                      
                        λ
                        WL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              b
                              
                                Φ
                                ,
                                i
                                ,
                                1
                              
                            
                            
                              λ
                              1
                            
                          
                          -
                          
                            
                              b
                              
                                Φ
                                ,
                                i
                                ,
                                2
                              
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                    -
                    
                      
                        λ
                        NL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              b
                              
                                P
                                ,
                                i
                                ,
                                1
                              
                            
                            
                              λ
                              1
                            
                          
                          +
                          
                            
                              b
                              
                                P
                                ,
                                i
                                ,
                                2
                              
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          
                            i
                            ,
                            MW
                          
                        
                      
                    
                  
                
                +
                -
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    [
                    
                      
                        
                          λ
                          WL
                        
                        ⁡
                        
                          (
                          
                            
                              
                                b
                                
                                  Φ
                                  ,
                                  1
                                
                                j
                              
                              
                                λ
                                1
                              
                            
                            -
                            
                              
                                b
                                
                                  Φ
                                  ,
                                  2
                                
                                j
                              
                              
                                λ
                                2
                              
                            
                          
                          )
                        
                      
                      -
                      
                        
                          λ
                          NL
                        
                        ⁡
                        
                          (
                          
                            
                              
                                b
                                
                                  P
                                  ,
                                  1
                                
                                j
                              
                              
                                λ
                                1
                              
                            
                            +
                            
                              
                                b
                                
                                  P
                                  ,
                                  2
                                
                                j
                              
                              
                                λ
                                2
                              
                            
                          
                          )
                        
                      
                    
                    ]
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          MW
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  λ
                  WL
                
                ⁢
                
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                  ++
                
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        λ
                        WL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              m
                              
                                Φ
                                ,
                                i
                                ,
                                1
                              
                              j
                            
                            
                              λ
                              1
                            
                          
                          -
                          
                            
                              m
                              
                                Φ
                                ,
                                i
                                ,
                                2
                              
                              j
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                    -
                    
                      
                        λ
                        NL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              m
                              
                                P
                                ,
                                i
                                ,
                                1
                              
                              j
                            
                            
                              λ
                              1
                            
                          
                          +
                          
                            
                              m
                              
                                P
                                ,
                                i
                                ,
                                2
                              
                              j
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          m
                          
                            i
                            ,
                            MW
                          
                          j
                        
                      
                    
                  
                
                ++
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        λ
                        WL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              ɛ
                              
                                Φ
                                ,
                                i
                                ,
                                1
                              
                              j
                            
                            
                              λ
                              1
                            
                          
                          -
                          
                            
                              ɛ
                              
                                Φ
                                ,
                                i
                                ,
                                2
                              
                              j
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                    -
                    
                      
                        λ
                        NL
                      
                      ⁡
                      
                        (
                        
                          
                            
                              ɛ
                              
                                P
                                ,
                                i
                                ,
                                1
                              
                              j
                            
                            
                              λ
                              1
                            
                          
                          +
                          
                            
                              ɛ
                              
                                P
                                ,
                                i
                                ,
                                2
                              
                              j
                            
                            
                              λ
                              2
                            
                          
                        
                        )
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          ɛ
                          
                            i
                            ,
                            MW
                          
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  b
                  
                    i
                    ,
                    MW
                  
                
                -
                
                  b
                  MW
                  j
                
                +
                
                  
                    λ
                    WL
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                
                +
                
                  m
                  
                    i
                    ,
                    MW
                  
                  j
                
                +
                
                  ɛ
                  
                    i
                    ,
                    MW
                  
                  j
                
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




where the ionospheric term in the WL-phase cancels with the ionospheric term in the NL-code due to





  
    
      
        
          
            -
            
              
                λ
                WL
              
              ⁡
              
                (
                
                  
                    1
                    
                      
                        λ
                        1
                      
                      ⁢
                      
                        f
                        1
                        2
                      
                    
                  
                  -
                  
                    1
                    
                      
                        λ
                        2
                      
                      ⁢
                      
                        f
                        2
                        2
                      
                    
                  
                
                )
              
            
          
          -
          
            
              λ
              NL
            
            ⁡
            
              (
              
                
                  1
                  
                    
                      λ
                      1
                    
                    ⁢
                    
                      f
                      1
                      2
                    
                  
                
                +
                
                  1
                  
                    
                      λ
                      2
                    
                    ⁢
                    
                      f
                      2
                      2
                    
                  
                
              
              )
            
          
        
        =
        
          
            
              -
              
                c
                
                  
                    f
                    1
                  
                  -
                  
                    f
                    2
                  
                
              
            
            ⁢
            
              (
              
                
                  c
                  
                    f
                    1
                  
                
                -
                
                  c
                  
                    f
                    2
                  
                
              
              )
            
          
          -
          
            
              c
              
                
                  f
                  1
                
                +
                
                  f
                  2
                
              
            
            ⁢
            
              (
              
                
                  c
                  
                    f
                    1
                  
                
                +
                
                  c
                  
                    f
                    2
                  
                
              
              )
            
            ⁢
          
        
      
    
  
  
    
      
        =
        
          
            
              -
              
                
                  c
                  2
                
                
                  
                    f
                    1
                  
                  -
                  
                    f
                    2
                  
                
              
            
            ⁢
            
              
                
                  f
                  2
                
                -
                
                  f
                  1
                
              
              
                
                  f
                  1
                
                ⁢
                
                  f
                  2
                
              
            
          
          -
          
            
              
                c
                2
              
              
                
                  f
                  1
                
                +
                
                  f
                  2
                
              
            
            ⁢
            
              
                
                  f
                  2
                
                +
                
                  f
                  1
                
              
              
                
                  f
                  1
                
                ⁢
                
                  f
                  2
                
              
            
            ⁢
          
        
      
    
  
  
    
      
        =
        
          
            +
            
              
                c
                2
              
              
                
                  f
                  1
                
                ⁢
                
                  f
                  2
                
              
            
          
          -
          
            
              c
              2
            
            
              
                f
                1
              
              ⁢
              
                f
                2
              
            
          
        
      
    
  
  
    
      
        =
        0
      
    
  




Neglecting the usually unmodeled multipath mi,MWj and random noise terms εi,MWj, equation (10) simplifies to

Φi,WLj−Pi,NLj=bi,MW−bMWj+λWLNi,WLj  (11)

or in a between satellite single difference (SD) version to

Φi,WLj1j2−Pi,NLj1j2=−bMWj1j2+λWLNi,WLj1j2  (12)

Note that the satellite bias cancels in the double difference (DD) (between receivers and between satellites) Melbourne-Wübbena (MW) observation,

Φi1i2,WLj1j2−Pi1i2,NLj1j2=λWLNi1i2,WLj1j2.  (13)

Thus the DD-WL ambiguities Ni1i2,WLj1j2 are directly observed by the DD-MW observations.

The iono-free linear combination on code




  
    P
    
      i
      ,
      IF
    
    j
  
  :=
  
    
      
        
          f
          1
          2
        
        ⁢
        
          P
          
            i
            ,
            1
          
          j
        
      
      -
      
        
          f
          2
          2
        
        ⁢
        
          P
          
            i
            ,
            2
          
          j
        
      
    
    
      
        f
        1
        2
      
      -
      
        f
        2
        2
      
    
  




and carrier phase





  
    Φ
    
      i
      ,
      IF
    
    j
  
  :=
  
    
      
        
          f
          1
          2
        
        ⁢
        
          Φ
          
            i
            ,
            1
          
          j
        
      
      -
      
        
          f
          2
          2
        
        ⁢
        
          Φ
          
            i
            ,
            2
          
          j
        
      
    
    
      
        f
        1
        2
      
      -
      
        f
        2
        2
      
    
  




results in





  
    
      
        
          
            
              
                P
                
                  i
                  ,
                  IF
                
                j
              
              =
              
              ⁢
              
                
                  ρ
                  i
                  j
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    i
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    j
                  
                
                +
                
                  T
                  i
                  j
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          b
                          
                            P
                            ,
                            i
                            ,
                            1
                          
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          b
                          
                            P
                            ,
                            i
                            ,
                            2
                          
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          
                            P
                            ,
                            i
                            ,
                            IF
                          
                        
                      
                    
                  
                
                -
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          b
                          
                            P
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          b
                          
                            P
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          
                            P
                            ,
                            IF
                          
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          m
                          
                            P
                            ,
                            i
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          m
                          
                            P
                            ,
                            i
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          m
                          
                            P
                            ,
                            i
                            ,
                            IF
                          
                          j
                        
                      
                    
                  
                
                -
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          ɛ
                          
                            P
                            ,
                            i
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          ɛ
                          
                            P
                            ,
                            i
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          ɛ
                          
                            P
                            ,
                            i
                            ,
                            IF
                          
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ρ
                  i
                  j
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    i
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    j
                  
                
                +
                
                  T
                  i
                  j
                
                +
                
                  b
                  
                    P
                    ,
                    i
                    ,
                    IF
                  
                
                -
                
                  b
                  
                    P
                    ,
                    IF
                  
                  j
                
                +
                
                  m
                  
                    P
                    ,
                    i
                    ,
                    IF
                  
                  j
                
                +
                
                  ɛ
                  
                    P
                    ,
                    i
                    ,
                    IF
                  
                  j
                
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  
  
    
      and
    
    
      
        
      
    
  
  
    
      
        
          
            
              
                Φ
                
                  i
                  ,
                  IF
                
                j
              
              =
              
              ⁢
              
                
                  ρ
                  i
                  j
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    i
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    j
                  
                
                +
                
                  T
                  i
                  j
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          b
                          
                            Φ
                            ,
                            i
                            ,
                            1
                          
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          b
                          
                            Φ
                            ,
                            i
                            ,
                            2
                          
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          
                            Φ
                            ,
                            i
                            ,
                            IF
                          
                        
                      
                    
                  
                
                -
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          b
                          
                            Φ
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          b
                          
                            P
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          b
                          
                            Φ
                            ,
                            IF
                          
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          λ
                          1
                        
                        ⁢
                        
                          N
                          
                            i
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          λ
                          2
                        
                        ⁢
                        
                          N
                          
                            i
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          
                            λ
                            IF
                          
                          ⁢
                          
                            N
                            
                              i
                              ,
                              IF
                            
                            j
                          
                        
                      
                    
                  
                
                +
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        ⁢
                        
                          m
                          
                            Φ
                            ,
                            i
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          f
                          2
                          2
                        
                        ⁢
                        
                          m
                          
                            Φ
                            ,
                            i
                            ,
                            2
                          
                          j
                        
                      
                    
                    
                      
                        f
                        1
                        2
                      
                      -
                      
                        f
                        2
                        2
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          m
                          
                            Φ
                            ,
                            i
                            ,
                            IF
                          
                          j
                        
                      
                    
                  
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      
                        f
                        1
                        2
                      
                      ⁢
                      
                        ɛ
                        
                          Φ
                          ,
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        f
                        2
                        2
                      
                      ⁢
                      
                        ɛ
                        
                          Φ
                          ,
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      f
                      1
                      2
                    
                    -
                    
                      f
                      2
                      2
                    
                  
                
                
                  }
                  
                    =
                    
                      :
                      
                        ɛ
                        
                          Φ
                          ,
                          i
                          ,
                          IF
                        
                        j
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ρ
                  i
                  j
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    i
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    j
                  
                
                +
                
                  T
                  i
                  j
                
                +
                
                  b
                  
                    Φ
                    ,
                    i
                    ,
                    IF
                  
                
                -
                
                  b
                  
                    Φ
                    ,
                    IF
                  
                  j
                
                +
                
                  
                    λ
                    IF
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      IF
                    
                    j
                  
                
                +
              
            
          
        
        
          
            
              
              ⁢
              
                
                  m
                  
                    Φ
                    ,
                    i
                    ,
                    IF
                  
                  j
                
                +
                
                  ɛ
                  
                    Φ
                    ,
                    i
                    ,
                    IF
                  
                  j
                
              
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




Neglecting the usually unmodeled multipath mP,i,IFj, mΦ,i,IFj and random noise terms εP,i,IFj, εΦ,i,IFj, (14) and (15) simplify to

Pi,IFj=ρij+cΔti−cΔtj+Tij+bP,i,IF−bP,IFj.  (16)

Φi,IFj=ρij+cΔti−cΔtj+Tij+bΦ,i,IF−bΦ,IFj+λIFNi,IFj.  (17)

or in a between satellite single difference (SD) version to

Pi,IFj1j2=ρij1j2−cΔtj1j2+Tij1j2−bP,IFj1j2.  (18)

Φi,IFj1j2=ρij1j2−cΔtj1j2+Tij1j2−bΦ,IFj1j2λIFNi,IFj1j2.  (19)

The iono-free wavelength λIF just depends on the ratio of the involved frequencies that are listed for different GNSS in Table 1 and Table 2.









TABLE 1








GPS
Galileo
















L1
L2
L5
E2L1E1
E5a
E5b
E5a/b
E6





10.23 MHz
154
120
115
154
115
118
116.5
125
















TABLE 2







Glonass 










L1
L2







(1602 + k · 9/16) MHz
(1246 + k · 7/16) MHz











  
    
      (
      
        
          k
          =
          
            -
            7
          
        
        ,
        
          
        
        ⁢
        ...
        ,
        
          +
          6
        
      
      )
    
    ⁢
    
      
    
    ⁢
    
      
        L
        ⁢
        
          
        
        ⁢
        1
      
      
        L
        ⁢
        
          
        
        ⁢
        2
      
    
  
  =
  
    9
    7
  










Defining F1, F2εN by




  
    
      
        
          
            
              
                
                  
                    f
                    1
                  
                  =
                  
                    
                      :
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      F
                      1
                    
                    ⁢
                    
                      
                    
                    ⁢
                    gcd
                    ⁢
                    
                      
                    
                    ⁢
                    
                      (
                      
                        
                          f
                          1
                        
                        ,
                        
                          f
                          2
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  
                    f
                    2
                  
                  =
                  
                    
                      :
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      F
                      2
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      gcd
                      ⁡
                      
                        (
                        
                          
                            f
                            1
                          
                          ,
                          
                            f
                            2
                          
                        
                        )
                      
                    
                  
                
              
            
          
          ⇒
          
            
              f
              1
            
            
              f
              2
            
          
        
        =
        
          
            F
            1
          
          
            F
            2
          
        
      
    
    
      
        (
        20
        )
      
    
  




where gcd is an abbreviation for the greatest common divisor, it follows for the iono-free wavelength





  
    
      
        
          
            
              
                
                  λ
                  IF
                
                ⁢
                
                  N
                  
                    i
                    ,
                    IF
                  
                  j
                
              
              :=
              
              ⁢
              
                
                  
                    
                      f
                      1
                      2
                    
                    ⁢
                    
                      λ
                      1
                    
                    ⁢
                    
                      N
                      
                        i
                        ,
                        1
                      
                      j
                    
                  
                  -
                  
                    
                      f
                      2
                      2
                    
                    ⁢
                    
                      λ
                      2
                    
                    ⁢
                    
                      N
                      
                        i
                        ,
                        2
                      
                      j
                    
                  
                
                
                  
                    f
                    1
                    2
                  
                  -
                  
                    f
                    2
                    2
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  λ
                  1
                
                ⁢
                
                  
                    
                      
                        f
                        1
                        2
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        f
                        2
                        2
                      
                      ⁢
                      
                        
                          λ
                          2
                        
                        
                          λ
                          1
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      f
                      1
                      2
                    
                    -
                    
                      f
                      2
                      2
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  λ
                  2
                
                ⁢
                
                  
                    
                      
                        f
                        1
                        2
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        f
                        2
                        2
                      
                      ⁢
                      
                        
                          f
                          1
                        
                        
                          f
                          2
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      f
                      1
                      2
                    
                    -
                    
                      f
                      2
                      2
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  λ
                  1
                
                ⁢
                
                  
                    
                      
                        
                          f
                          1
                          2
                        
                        
                          f
                          2
                          2
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        
                          f
                          1
                        
                        
                          f
                          2
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      
                        f
                        1
                        2
                      
                      
                        f
                        2
                        2
                      
                    
                    -
                    1
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  λ
                  1
                
                ⁢
                
                  
                    
                      
                        
                          F
                          1
                          2
                        
                        
                          F
                          2
                          2
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        
                          F
                          1
                        
                        
                          F
                          2
                        
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      
                        F
                        1
                        2
                      
                      
                        F
                        2
                        2
                      
                    
                    -
                    1
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  λ
                  1
                
                ⁢
                
                  
                    F
                    1
                  
                  
                    F
                    2
                    2
                  
                
                ⁢
                
                  
                    
                      
                        F
                        1
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          1
                        
                        j
                      
                    
                    -
                    
                      
                        F
                        2
                      
                      ⁢
                      
                        N
                        
                          i
                          ,
                          2
                        
                        j
                      
                    
                  
                  
                    
                      
                        F
                        1
                        2
                      
                      -
                      
                        F
                        2
                        2
                      
                    
                    
                      F
                      2
                      2
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    
                      λ
                      1
                    
                    ⁢
                    
                      
                        F
                        1
                      
                      
                        
                          F
                          2
                        
                        -
                        
                          F
                          2
                          2
                        
                      
                    
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          λ
                          IF
                        
                      
                    
                  
                
                ⁢
                
                  
                    (
                    
                      
                        
                          F
                          1
                        
                        ⁢
                        
                          N
                          
                            i
                            ,
                            1
                          
                          j
                        
                      
                      -
                      
                        
                          F
                          2
                        
                        ⁢
                        
                          N
                          
                            i
                            ,
                            2
                          
                          j
                        
                      
                    
                    )
                  
                  
                    }
                    
                      :=
                      
                        N
                        
                          i
                          ,
                          IF
                        
                        j
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




The factors F1, F2 are listed for different GNSS frequency combinations together with the resulting iono-free wavelengths in Table 3.












TABLE 3





 GNSS
Freq. bands
 F1/F2
 λ1/m
 λNL/m




  
    
      λ
      IF
    
    
      λ
      1
    
  
  =
  
    
      F
      1
    
    
      
        F
        1
        2
      
      -
      
        F
        2
        2
      
    
  











GPS
L1-L2
77/60
0.1903
0.1070
0.0331



L1-L5
154/115
0.1903
0.1089
0.0147



L2-L5
24/23
0.2442
0.1247
0.5106


Galileo
L1-E5a
154/115
0.1903
0.1089
0.0147



L1-E5b
77/59
0.1903
0.1077
0.0315



L1-E6
154/125
0.1903
0.1050
0.019 



E5b-E5a
118/115
0.2483
0.1258
0.1688



E6-E5a
25/23
0.2344
0.1221
0.2604



E6-E5b
125/118
0.2344
0.1206
0.0735


 


Glonass
L1-L2
9/7




  c
  
    
      (
      
        1602
        +
        
          
            k
            ·
            9
          
          ⁢
          
            /
          
          ⁢
          16
        
      
      )
    
    ·
    
      10
      6
    
  








  c
  
    
      (
      
        2848
        +
        k
      
      )
    
    ·
    
      10
      6
    
  




0.2813









    
    
        (22)
    
    


Since for most frequency combinations the iono-free wavelength λIF is too small for reliable ambiguity resolution (the frequency combination L2-L5 is a mentionable exception), the following relation between the iono-free ambiguity Ni,IFj and the widelane ambiguity Ni,WLj is of special importance. By using the definitions




  
    
      
        
          
            
              
                
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                  :=
                  
                    
                      N
                      
                        i
                        ,
                        1
                      
                      j
                    
                    -
                    
                      N
                      
                        i
                        ,
                        2
                      
                      j
                    
                  
                
              
            
            
              
                
                  
                    N
                    
                      i
                      ,
                      NL
                    
                    j
                  
                  :=
                  
                    
                      N
                      
                        i
                        ,
                        1
                      
                      j
                    
                    +
                    
                      N
                      
                        i
                        ,
                        2
                      
                      j
                    
                  
                
              
            
          
          }
        
        ⇔
        
          
            
              
                
                  N
                  
                    i
                    ,
                    1
                  
                  j
                
                =
                
                  
                    1
                    2
                  
                  ⁢
                  
                    (
                    
                      
                        N
                        
                          i
                          ,
                          NL
                        
                        j
                      
                      +
                      
                        N
                        
                          i
                          ,
                          WL
                        
                        j
                      
                    
                    )
                  
                
              
            
          
          
            
              
                
                  N
                  
                    i
                    ,
                    2
                  
                  j
                
                =
                
                  
                    1
                    2
                  
                  ⁢
                  
                    (
                    
                      
                        N
                        
                          i
                          ,
                          NL
                        
                        j
                      
                      +
                      
                        N
                        
                          i
                          ,
                          WL
                        
                        j
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        23
        )
      
    
  




the iono-free ambiguity term can be rewritten as





  
    
      
        
          
            
              λ
              IF
            
            ⁢
            
              N
              
                i
                ,
                IF
              
              j
            
          
          :=
          
            
              
                
                  
                    f
                    1
                    2
                  
                  
                    
                      f
                      1
                      2
                    
                    -
                    
                      f
                      2
                      
                        2
                        ⁢
                        
                          
                        
                      
                    
                  
                
                ⁢
                
                  λ
                  1
                
                ⁢
                
                  N
                  
                    i
                    ,
                    1
                  
                  j
                
              
              -
              
                
                  
                    f
                    2
                    2
                  
                  
                    
                      f
                      1
                      2
                    
                    -
                    
                      f
                      2
                      2
                    
                  
                
                ⁢
                
                  λ
                  2
                
                ⁢
                
                  N
                  
                    i
                    ,
                    2
                  
                  j
                
              
            
            =
            
              
                
                  
                    
                      (
                      
                        
                          
                            
                              f
                              1
                              2
                            
                            
                              
                                f
                                1
                                2
                              
                              -
                              
                                f
                                2
                                2
                              
                            
                          
                          ⁢
                          
                            c
                            
                              f
                              1
                            
                          
                        
                        +
                        
                          
                            
                              f
                              2
                              2
                            
                            
                              
                                f
                                1
                                2
                              
                              -
                              
                                f
                                2
                                2
                              
                            
                          
                          ⁢
                          
                            c
                            
                              f
                              2
                            
                          
                        
                      
                      )
                    
                    
                      }
                      
                        
                          
                            
                              cf
                              1
                            
                            
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  -
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                              ⁢
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  +
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                            
                          
                          +
                          
                            
                              cf
                              2
                            
                            
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  -
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                              ⁢
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  +
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                            
                          
                        
                        =
                        
                          
                            c
                            
                              
                                f
                                1
                              
                              -
                              
                                f
                                2
                              
                            
                          
                          =
                          
                            :
                            
                              λ
                              WL
                            
                          
                        
                      
                    
                  
                  ⁢
                  
                    1
                    2
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                
                +
                
                  
                    
                      (
                      
                        
                          
                            
                              f
                              1
                              2
                            
                            
                              
                                f
                                1
                                2
                              
                              -
                              
                                f
                                2
                                2
                              
                            
                          
                          ⁢
                          
                            c
                            
                              f
                              1
                            
                          
                        
                        -
                        
                          
                            
                              f
                              2
                              2
                            
                            
                              
                                f
                                1
                                2
                              
                              -
                              
                                f
                                2
                                2
                              
                            
                          
                          ⁢
                          
                            c
                            
                              f
                              2
                            
                          
                        
                      
                      )
                    
                    
                      }
                      
                        
                          
                            
                              cf
                              1
                            
                            
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  -
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                              ⁢
                              
                                (
                                
                                  f
                                  
                                    1
                                    +
                                    
                                      f
                                      2
                                    
                                  
                                
                                )
                              
                            
                          
                          -
                          
                            
                              cf
                              2
                            
                            
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  -
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                              ⁢
                              
                                (
                                
                                  
                                    f
                                    1
                                  
                                  +
                                  
                                    f
                                    2
                                  
                                
                                )
                              
                            
                          
                        
                        =
                        
                          
                            c
                            
                              
                                f
                                1
                              
                              -
                              
                                f
                                2
                              
                            
                          
                          =
                          
                            :
                            
                              λ
                              NL
                            
                          
                        
                      
                    
                  
                  ⁢
                  
                    1
                    2
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                
              
              =
              
                
                  
                    1
                    2
                  
                  ⁢
                  
                    λ
                    NL
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      NL
                    
                    j
                  
                
                +
                
                  
                    1
                    2
                  
                  ⁢
                  
                    λ
                    WL
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                
              
            
          
        
        ;
        
          
            N
            
              i
              ,
              NL
            
            j
          
          =
          
            
              
                N
                
                  i
                  ,
                  1
                
                j
              
              +
              
                N
                
                  i
                  ,
                  2
                
                j
              
            
            =
            
              
                
                  N
                  
                    i
                    ,
                    1
                  
                  j
                
                +
                
                  
                    1
                    2
                  
                  ⁢
                  
                    (
                    
                      
                        N
                        
                          i
                          ,
                          NL
                        
                        j
                      
                      -
                      
                        N
                        
                          i
                          ,
                          WL
                        
                        j
                      
                    
                    )
                  
                
              
              =
              
                
                  
                    λ
                    NL
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      1
                    
                    j
                  
                
                +
                
                  
                    1
                    2
                  
                  ⁢
                  
                    (
                    
                      
                        λ
                        WL
                      
                      -
                      
                        λ
                        NL
                      
                    
                    )
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    i
                  
                
              
            
          
        
      
    
    
      
        (
        24
        )
      
    
  




Thus, once the widelane ambiguity Ni,WLj has been fixed to integer on base of the Melbourne-Wübbena linear combination (11), the relation (24) can be used for integer resolution of the unconstrained narrowlane ambiguity Ni,1j (especially when λNL>>λIF, see Table 3),




  
    
      
        
          N
          
            i
            ,
            1
          
          j
        
        =
        
          
            1
            
              λ
              NL
            
          
          ⁢
          
            (
            
              
                
                  λ
                  IF
                
                ⁢
                
                  N
                  
                    i
                    ,
                    IF
                  
                  j
                
              
              -
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      λ
                      WL
                    
                    -
                    
                      λ
                      NL
                    
                  
                  )
                
                ⁢
                
                  N
                  
                    i
                    ,
                    WL
                  
                  j
                
              
            
            )
          
        
      
    
    
      
        (
        25
        )
      
    
  




We call Ni,1j the unconstrained or free narrowlane ambiguity since it occurs in (24) in combination with the narrowlane wavelength λNL and does not depend on whether the fixed widelane is even or odd. Since NNL=NWL+2N2 (see (23)), NNL always has to have for consistency reasons the same even/odd status as NWL and is therefore already constrained to some extent.
Part 5: Kalman Filter Overview
Some embodiments of the standard clock processor 320, the MW bias processor 325, the orbit processor 330 and the phase clock processor 335 use a Kalman filter approach.
FIG. 6 shows a diagram of the Kalman filter algorithm 600. The modeling underlying the Kalman filter equations relate the state vector xk at time step k (containing the unknown parameters) to the observations (measurements) zk via the design matrix Hk and to the state vector at time step k−1 via the state transition matrix φk-1, together with process noise wk-1 and observation noise vk whose covariance matrices are assumed to be known as Qk, Rk, respectively. Then the Kalman filter equations predict the estimated state {circumflex over (x)}k-1 together with its covariance matrix Pk-1 via the state transition matrix φk-1 and process noise input described by covariance matrix Qk-1 to time step k resulting in predicted state {circumflex over (x)}k− and predicted covariance matrix Pk−. Predicted state matrix and state covariance matrix are then corrected by the observation zk in the Kalman filter measurement update where the gain matrix Kk plays a central role in the state update as well as in the state covariance update.
Part 6: Code-Leveled Clock Processor
The estimated absolute code-leveled low-rate satellite clocks 365 are used in positioning solutions, for example to compute the precise send time of the GNSS signal and also to obtain a quick convergence of float position solutions, e.g., in precise point positioning. For send time computation a rough, but absolute, satellite clock error estimate can be used. Even the satellite clocks from the broadcast message are good enough for this purpose. However, the quality of single-differenced pairs of satellite clock errors is important to achieve rapid convergence in positioning applications. For this purpose a clock accuracy level of ca. 10 cm is desired.
Some embodiments use quality-controlled ionospheric-free combinations of GNSS observations from a global tracking network, optionally corrected for known effects, to estimate (mostly) uninterrupted absolute code-leveled satellite clock errors.
The raw GNSS reference station data 305 are optionally corrected by data corrector 310 to obtain corrected network data 315 as described in Part 3 above.
For each station, ionospheric-free combinations derived from observation of signals with different wavelengths (e.g. L1 and L2) and the broadcasted clock error predictions are used as an input for the filter:

Pr,IFs−cΔtrels=ρrs+cΔtP,r−cΔtPs+Trs+εP,r,IFs  (26)

Φr,IFs−cΔtrels=ρrs+cΔtP,r−cΔtPs+Trs+λNrs+εΦ,r,IFs  (27)

Δtbrcs≈ΔPs  (28)

where

Pr,IFs is the ionospheric-free code combination for each receiver-satellite pair r, s

Φr,IFs is the ionospheric-free phase observation for each receiver-satellite pair r, s

Δtbrcs is the broadcast satellite clock error prediction

ρrs is the geometric range from satellite s to receiver r

Δtrels represents the relativistic effects for satellite s

cΔtP,r:=cΔtr+bP,r,IF is the clock error for receiver r

cΔtPs:=cΔts+bP,IFs is the clock error for satellite s

Trs is the troposphere delay observed at receiver r

εP,r,IFs represents noise in the code measurement

εΦ,r,IFs represents noise in the carrier measurement

λNrs:=λIFNr,IFs+bΦ,r,IF−bP,r,IF−(bΦ,IFs−bP,IFs) is the float carrier ambiguity from satellite s to receiver r

The code and carrier observations are corrected for relativistic effects Δtrels, computed based on satellite orbits, when estimating the satellite clock error. Afterwards this term can be added to the estimated clock error to allow the rover using those satellites to correct for all time related effects at once.
The geometric range ρrs at each epoch can be computed from a precise satellite orbit and a precise reference station location. The respective noise terms εP,r,IFs and εΦ,r,IFs are not the same for code and carrier observations. Differencing the phase observation and code observation directly leads to a rough estimate of the carrier ambiguity Nrs though influenced by measurement noise and εP,r,IFs and εΦ,r,IFs:

Φr,IFs−Pr,IFs=λNrs+εΦ,r,IFs+εP,r,IFs.  (29)

Thus as an input for the filter this difference Φr,IFs−Pr,IFs, the phase measurement Φr,IFs and the broadcasted satellite clock error prediction Δtbrcs is used. The difference Φr,IFs−Pr,IFs is a pseudo measurement for the ambiguities, which are modeled as constants. As due to the biases the float ambiguity is not really a constant the estimated value represents the ambiguity together with a constant part of the biases. The non-constant part of the biases will end up in the residuals. This approximation leads to acceptable results as long as the biases are more or less constant values. The converged float ambiguities are used to define the level of the clock errors.

Once the ambiguities are converged, the phase measurement Φr,IFs provides a measurement for the clock errors and the troposphere. For the troposphere Trs=(1+cT,r){circumflex over (T)}rs it is sufficient to estimate only one scaling factor per receiver cT,r. A mapping to different elevations is computed using a troposphere model {circumflex over (T)}rs. The scaling factor can be assumed to vary over time like a random walk process.
For the satellite clocks a linear time discrete process is assumed

ΔtPs(ti+1)=ΔtPs(ti)+w1s(ti)+(Δ{dot over (t)}Ps(ti)+w2s(ti))(ti+1−ti)  (30)

with random walks w1s and w2s overlaid on the clock error ΔtPs and on the clock error rate Δ{dot over (t)}Ps. The receiver clocks are usually not as precise as the satellite clocks and are often unpredictable. Thus the receiver clocks are modeled as white noise to account for any behavior they might exhibit.

The system of receiver and satellite clocks is underdetermined if only code and phase observations are used. Thus all clock estimates can have a common trend (any arbitrary function added to each of the clocks). In a single difference this trend cancels out and each single difference clock is correct. To overcome this lack of information the broadcast clock error predictions can be used as pseudo observations for the satellite clock errors to keep the system close to GPS time.
The assumption of a random walk on the clock rate is equal to the assumption of a random run on the clock error itself. Optionally a quadratic clock error model is used to model changes in the clock rate. This additional parameter for clock rate changes can also be modeled as a random walk. The noise input used for the filter can be derived by an analysis of the clock errors using for example the (modified) Allan deviation or the Hadamard variance. The Allan deviation is described in A. van Dierendonck, Relationship between Allan Variances and Kalman Filter Parameters, PROCEEDINGS OF THE 16TH ANNUAL PRECISE TIME AND TIME INTERVAL (PTTI) SYSTEMS AND APPLICATION MEETING 1984, pp. 273-292. The Hadamard variance is described in S. Hutsell, Relating the Hadamard variance to MCS Kalman filter clock estimation, 27TH ANNUAL PRECISE TIME AND TIME INTERVAL (PTTI) APPLICATIONS AND PLANNING MEETING 1996, pp. 291-301.
There are many different approaches to overcome the underdetermined clock system besides adding the broadcasted satellite clock errors as pseudo-observations. One is to fix one of the satellite or receiver clock errors to the values of an arbitrarily chosen function (e.g. 0 or additional measurements of a good receiver clock). Another is to fix the mean of all clocks to some value, for example to the mean of broadcasted or ultra-rapid clock errors as done in A. Hausschild, Real-time Clock Estimation for Precise Orbit Determination of LEO-Satellites, ION GNSS 2008, Sep. 16-19, 2008, Savannah, Ga., 9 pp. This is taken into account in deriving the clock models; the system model and the noise model fits the clock error difference to the fixed clock error and no longer to the original clock error.
FIG. 7 is a schematic diagram of a “standard” code-leveled clock processor 320 in accordance with some embodiments of the invention. An iterative filter such as a Kalman filter 705 uses for example ionospheric-free linear combinations 710 of the reference station observations and clock error models 715 with broadcast satellite clocks 720 as pseudo-observations to estimate low-rate code-leveled (standard) satellite clocks 365, tropospheric delays 370, receiver clocks 725, satellite clock rates 730, (optionally) ionospheric-free float ambiguities 374, and (optionally) ionospheric-free code-carrier biases 372.
Further improvements can be made to quality of the clocks. Single differences of the estimated clock errors can exhibit a slow drift due to remaining errors in the corrected observations, errors in the orbits, and long term drift of the biases. After some time the single differences of the estimated clock errors no longer match a code-leveled clock. To account for such a drift, the mismatch between code and phase measurements is optionally estimated and applied to the estimated clock errors. In some embodiments this is done by setting up an additional filter such as filter 735 of FIG. 7 with only one bias per satellite and one per receiver, to estimate the ionospheric-free code-carrier biases 372 as indicated by “option 1.” The receiver biases are modeled for example as white noise processes. The satellite biases are modeled for example as random walk with an appropriate small input noise, because only low rate variations of the satellite biases are expected. Observations used for this filter are, for example, an ionospheric-free code combination 740, reduced by the tropospheric delay 370, the satellite clock errors 365 and the receiver clock errors 725 estimated in the above standard code-leveled clock filter 705. Rather than setting up the additional filter such as filter 730, the iono-free code-carrier biases are in some embodiments modeled as additional states in the code-leveled clock estimation filter 705, as indicated by “option 2.”
Part 7: MW (Melbourne-Wübbena) Bias Processor
Part 7.1 MW Bias: Motivation
The range signals emitted by navigation satellites and received by GNSS receivers contain a part for which delays in the satellite hardware are responsible. These hardware delays are usually just called satellite biases or uncalibrated delays. In differential GNSS processing the satellite biases do not play any role when both receivers receive the same code signals (e.g. in case of GPS both L I C/A or both LIP). However, the biases are always important for Precise Point Positioning (PPP) applications where the precise positioning of a single rover receiver is achieved with the help of precise satellite clocks and precise orbits determined on base of a global network of reference stations (as e.g. by the International GNSS service (IGS)) (Zumberge, Heflin, Jefferson, Watkins, & Webb, 1997), (Héroux & Kouba, 2001). Here the knowledge of satellite biases can allow to resolve undifferenced (or between satellite single differenced) integer ambiguities on the rover which is the key to fast high precision positioning without a reference station (Mervart, Lukes, Rocken, & Iwabuchi, 2008), (Collins, Lahaye, Héroux, & Bisnath, 2008).
Usually the satellite biases are assumed to be almost constant over time periods of weeks (Ge, Gendt, Rothacher, Shi, & Liu, 2008), and their variations can be neglected (Laurichesse & Mercier, 2007), (Laurichesse, Mercier, Berthias, & Bijac, 2008). Our own intensive studies revealed by processing in the here proposed way GPS data of a global network of reference stations over several months that there are daily repeating patterns in the Melbourne-Wübbena (MW) linear combination of satellite biases of size up to about 14 cm over 6 hours, as well as drifts over a month of up to about 17 cm and sometimes sudden bias level changes (of arbitrary size) of individual satellites within seconds (e.g. GPS PRN 24 on 2008 Jun. 26). Nevertheless, the daily repeatability of the MW satellite biases is usually in the range of 2 to 3 cm which is consistent with the literature. Therefore the real-time estimation of satellite biases as a dynamical system in a sequential least squares filter (like e.g. a Kalman filter ((Grewal & Andrews, 2001), (Bierman, 1977)) and the transmission of these biases to PPP based rover receivers (in addition to precise satellite clocks and orbits) becomes important for integer ambiguity resolution on the rover.
Part 7.2 MW Bias: Process Flow
FIG. 8 is a schematic diagram of a process flow 1100 for MW satellite bias and WL ambiguity determination in accordance with some embodiments. GNSS observation data 305 on code and carrier phase on at least two frequencies from a number of reference station receivers is used as the main input into the process. These observations are optionally corrected at 310 for effects that do not require estimation of any model parameters. Among the corrections typically used in PPP applications for the MW linear combination, especially the receiver and satellite antenna offsets and variations are of importance. Higher order ionospheric terms do not cancel in this linear combination. The optionally corrected GNSS observation data 315 is then forwarded to a module 1105 that generates linear combinations 1110 of the code and phase observations on two frequencies. The determined MW observation combinations 1110 are then input into a sequential filter 1115 (such as a Kalman filter) that relates MW observations Φi,WLj−Pi,NLj to the estimation parameters, i.e., the MW satellite biases bMWj 1120, WL ambiguities Ni,WLj 1125 and optionally MW receiver biases bi,MW 1130 via Equation (11) in the undifferenced case or via Equation (12) in the between satellite single difference case.
Importantly, process noise input on the MW satellite biases bMWj ensures that the biases can vary over time. Due to the periodic behavior of satellite biases, optionally the biases may also be modeled by harmonic functions, e.g. as

bMWj=b0j+b1j sin(αj)+b2j cos(αj)  (31)

where aj defines the position of satellite j in the orbit (e.g. αj could be the argument of latitude or the true anomaly) and b0j, b1j, b2j are the estimated parameters that need much less process noise than a single parameter bMWj and can therefore further stabilize the estimation process.

In addition to the observation data, a single MW bias constraint 1140 and several ambiguity constraints 1145 are input to the filter [935]. These constraints are additional arbitrary equations that are e.g. of the form

bWLj0=0  (32)

Ni,WLj=round(Ni,WLj)  (33)

and that are added to the filter with a very low observation variance of e.g. 10−30 m2. The constraints ensure that the system of linear equations in the filter 1115 is not underdetermined so that the variances of the model parameters immediately become of the same order as the observation variance. They have to be chosen in a careful way so that the system of linear equations is not over-constrained by constraining a double-difference WL ambiguity which is directly given by the MW observations (see equation (13). By constraining the ambiguities to an arbitrary integer, information about the integer nature of the ambiguities comes into the system. In a Kalman filter approach where the system of equations in (11) or (12) (optionally together with (31)) is extended by arbitrary equations for the initial values of all parameters so that always a well defined float solution (with variances of the size of the initial variances) exists, it is preferable to constrain the ambiguities to the closest integer of the Kalman filter float solution.

The estimated MW satellite biases 1120 are either directly used as the process output or after an optional additional WL ambiguity fixing step. Therefore the estimated WL ambiguities 1125 are optionally put into an ambiguity fixer module 1135. The resulting fixed WL ambiguities 340 (that are either fixed to integer or float values) are used as the second process output. Optionally the fixed WL ambiguities 340 are fed back into the filter 1115 (or into a filter copy or a secondary filter without ambiguity states (compare FIG. 21A-FIG. 22C) to get satellite MW bias output 1120 which is consistent with integer WL ambiguities.
The MW satellite biases 1120 are transferred for example via the scheduler 355 to rover receivers where they help in fixing WL ambiguities at the rover. Network WL ambiguities 1125 or 340 can be forwarded to the phase clock processor 335 and orbit processor 330 where they help in fixing iono-free (IF) ambiguities when the reference station data 305 from the same receiver network is used in these processors. Alternatively, instead of the network WL ambiguities 1125 or 340], MW satellite biases 1120 are transferred to orbit processor 330 and phase clock processor 335 to derive WL ambiguities in a station-wise process for the network receivers in the same way as it is done on the rover. Then the derived WL ambiguities help in fixing IF ambiguities. With such an approach, GNSS data from different reference station networks can be used in the different processors.
FIG. 9 shows a schematic diagram of a processing architecture 1200 in accordance with some embodiments. Code and carrier phase observations 1205 (e.g., from reference station data 305) on at least two frequencies from a number of reference station receivers are put into a linear combiner 1210 that generates a set of Melbourne-Wübbena (MW) linear combinations 1220, one such MW combination for each station-satellite pairing from code and carrier phase observations on two frequencies. If more than two frequencies are available several MW combinations can be generated for a single station-satellite pairing. These MW observations are then put into a processor 1225 that estimates at least MW biases per satellite 1230 and WL ambiguities per station-satellite pairing 1235 based on modeling equations (11) in the undifferenced case or (12) in the between satellite single difference case (both optionally together with (31)). The processor is usually one or more sequential filters such as one or more Kalman filters. Since it can also consist of several filters, here the more general term processor is used. Process noise 1240 input on the MW satellite biases in the processor allows them to vary from epoch to epoch even after the convergence phase of filtering. The outputs of the process are the estimated satellite MW biases 1230 and network WL ambiguities 1235.
Thus, some embodiments provide a method of processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising: forming an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch; and estimating from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.
Broadcast satellite orbits contained in the navigation message are optionally used, for example with coarse receiver positions, to reduce the incoming observations to a minimal elevation angle under which a satellite is seen at a station. The receiver positions are optionally given as an additional input, or alternatively can be derived as known in the art from the code observations and the broadcast satellite orbit. The restriction to observations of a minimal elevation can be done at any place before putting the observations into the processor. However, performing the restriction directly after pushing the code and carrier phase observations into the process avoids unnecessary computations.
FIG. 13A and FIG. 13B show respectively the state vectors for the undifferenced (=zero-differenced (ZD)) and single differenced embodiments, listing parameters to be estimated. The ZD state vector 1310 comprises n satellite bias states bMWj, a number of ambiguity states Ni,WLj that changes over time with the number of satellites visible at the stations, and m receiver bias states bi,MW. The SD state vector 1320 comprises n satellite bias states bMWjj0 to a fixed reference satellite j0 that can be either a physical or an artificial satellite. In addition, the SD state vector comprises the same number of ambiguity states as in the ZD case. However, here each ambiguity represents an SD ambiguity to a physical or artificial satellite. Each station can have its own choice of reference satellite. In the SD case no receiver bias states are necessary, so that there are always m less states in the SD state vector 1320 than in the comparable ZD state vector 1310. More details about artificial reference satellites follow in Part 7.4.
Part 7.3 MW Process: Correcting and Smoothing
FIG. 11 shows a process 1400 with the addition of observation correction to the MW process of FIG. 9. Some embodiments add the observation data corrector module 310 of FIG. 3. Code and carrier phase observations 1205 on at least two frequencies from a number of reference stations (e.g., from reference station data 305) are corrected in the optional observation data corrector 310 for effects that do not require estimation of any model parameters (especially receiver and satellite antenna offsets and variations, and higher order ionospheric effects). Knowledge of the broadcast satellite orbits 1245 and the coarse receiver positions 1250 is used for this. The corrected observation data 1310 are then optionally fed into the process of FIG. 12 to produce MW satellite biases 1330 and widelane ambiguities 1335.
In FIG. 12, code and carrier phase observations 1205 on at least two frequencies from a number of reference stations (e.g., from reference station data 305) are optionally corrected in the observation data corrector 310, then combined in a linear combiner 1210 to form Melbourne-Wübbena linear combinations 1220 and finally smoothed over several epochs in a smoother 1410 to form smoothed Melbourne-Wübbena combinations 1420. Alternatively, smoothing can be done on the original observations or on any other linear combination of the original observations before generating the MW linear combination. In any case, the resulting smoothed MW observations are put into the processor 1225 for estimating MW satellite biases 1430 and WL ambiguities 1435 as in the embodiments of FIG. 9 and FIG. 11.
Smoothing means to combine multiple observations over time, e.g. by a simple averaging operation, to obtain a reduced-noise observation. MW smoothing is done to reduce the multipath error present in (10) that is not explicitly modeled in the processor 1225, e.g., as in modeling equations (11) and (12). Smoothing is motivated by the expectation that the MW observation is almost constant over short time periods since the MW observation only consists of hardware biases and a (constant) ambiguity term. A reasonable smoothing interval is, for example, 900 seconds. An additional advantage of smoothing the MW observations is that an observation variance can be derived for the smoothed observation from the input data by the variance of the mean value,




  
    
      
        
          σ
          
            obs
            ,
            MW
          
          2
        
        =
        
          
            
              
                
                  ∑
                  
                    t
                    =
                    1
                  
                  n
                
                ⁢
                
                  
                    (
                    
                      
                        x
                        t
                      
                      -
                      
                        x
                        _
                      
                    
                    )
                  
                  2
                
              
              
                
                  (
                  
                    n
                    -
                    1
                  
                  )
                
                ⁢
                n
              
            
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            
              x
              _
            
          
          =
          
            
              1
              n
            
            ⁢
            
              
                ∑
                
                  t
                  =
                  1
                
                n
              
              ⁢
              
                x
                t
              
            
          
        
      
    
    
      
        (
        34
        )
      
    
  




where xt is the MW observation at smoothing epoch t and n is the number of observations used in the smoothing interval. To ensure that this variance really reflects multipath and not just a too-small number of possibly unreliable observations in the smoothing interval, it is advantageous to accept a smoothed observation as filter input only when a minimal number of observations is available, e.g. 80% of the theoretical maximum. Note that the statistical data that holds mean value and variance of the Melbourne-Wübbena observation has to be reset in case of an unrepaired cycle slip since this observation contains an ambiguity term. Of course, a cycle slip also requires a reset of the corresponding ambiguity in the filter.

If smoothing is done by a simple averaging operation over a fixed time interval, smoothing implies different data rates in the process. Observations 1205 are coming in with a high data rate, while smoothed MW observations 1420 are forwarded to the processor with a lower data rate. This kind of smoothing has the advantage that observations put into the processor are not correlated and can therefore be handled in a mathematically correct way. The alternative of using some kind of a (weighted) moving average allows to stay with a single (high) data rate, but has the disadvantage that the resulting smoothed observations become mathematically correlated.
Part 7.4 MW Process: MW Bias Constraint
FIG. 13 shows a process 1600 with the addition of one or more MW bias constraints to the process of FIG. 12, which can similarly be added to the embodiments shown in FIG. 9, FIG. 11. At least one MW bias constraint 1605 like (32) is put into the processor to reduce the rank defect in modeling equations (11) or (12).
The rank defect in (11) or (12) becomes apparent by counting the number of observations and the number of unknowns in these equations. For example in (11), if there are i=1, . . . , m stations and j=1, . . . , n satellites and it is assumed that all satellites are seen at all stations, there will be m·n Melbourne-Wübbena observations. However, at the same time there are also in m·n unknown ambiguities Ni,WLj in addition to m receiver biases bi,MW and n satellite biases bMWj, resulting in m·n+m+n unknowns. Thus the system of equations defined by (11) can only be solved if the number of arbitrary constraints introduced into the system is the number of unknowns minus the number of observations, i.e. (m·n+m+n)−(m·n)=m+n.
Most of these constraints should be ambiguity constraints as the following consideration demonstrates. For n satellites n−1 independent between-satellite single differences can be generated. In the same way, from m stations m−1 between station single differences can be derived. In a double difference (DD) between stations and satellites these independent single differences are combined, resulting in (m·1)·(n−1)=m·n−(m+n−1) double difference observations. Since as in (13) the DD ambiguities are uniquely determined by the DD-MW observations, the difference between the m·n ambiguities in (11) and the m·n−(m+n−1) unique DD ambiguities should be constrained, resulting in m+n−1 ambiguity constraints. Thus from the m+n required constraints all but one should be ambiguity constraints. The remaining arbitrary constraint should be a constraint on the biases. This statement remains true in the more general case when not all satellites are seen at all stations and thus the number of required constraints can no longer be counted in the demonstrated simple way. The constraint on the biases itself is an arbitrary equation like (32) or more generally of the form




  
    
      
        
          
            
              
                ∑
                i
              
              ⁢
              
                
                  a
                  i
                
                ⁢
                
                  b
                  
                    i
                    ,
                    MW
                  
                
              
            
            +
            
              
                ∑
                j
              
              ⁢
              
                
                  a
                  j
                
                ⁢
                
                  b
                  MW
                  j
                
              
            
          
          =
          
            b
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            
              a
              i
            
          
        
        ,
        
          a
          j
        
        ,
        
          b
          ∈
          R
        
      
    
    
      
        (
        35
        )
      
    
  




In the single difference case (12) the constraint on the biases is more straightforward. The state vector of the satellite biases does not contain all possible SD biases but only the independent ones. This is achieved by taking an arbitrary reference satellite and choosing as states only the SD biases to the reference. To be prepared for a changing reference satellite in case the old reference satellite is not observed anymore, it is preferable to also have a state for the reference satellite. However, the SD bias of the reference to itself has to be zero.

bMWjrefjref=bMWjref−bMWjref≡0  (36)

This equation is added as a constraint. Note, however, that the SD bias states are not necessarily interpreted as SDs to a physical reference satellite. It is also possible to have an artificial reference satellite with a bias that is related to the biases of the physical satellites (this ensures that the artificial satellite is connected to the physical satellites)





  
    
      
        
          
            ∑
            i
          
          ⁢
          
            
              a
              j
            
            ⁢
            
              b
              MW
              j
            
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            
              a
              j
            
          
        
        ,
        
          b
          ∈
          R
        
      
    
    
      
        (
        37
        )
      
    
  




By specifying arbitrary values for aj, b (with at least one aj≠0) and introducing (37) as a constraint into (12), the information about the bias of the reference satellite comes into the system.
With knowledge of MW satellite biases (as they are derived from the system proposed here) from a different source, it is also reasonable to introduce more than one bias constraint into the system. For example, if all MW satellite biases are constrained, it is in a single-difference approach not necessary to introduce any ambiguity constraints into the system, since (12) can be rewritten as

Φi,WLj1j2−Pi,NLj1j2+bMWj1j2=λWLNi,WLj1j2  (38)

Thus all SD ambiguities Ni,WLj1j2 are uniquely determined with knowledge of the SD-MW satellite biases. It is exactly this relation that helps a rover receiver to solve for its WL ambiguities with the help of the here derived MW satellite biases.
In the undifferenced approach, one ambiguity constraint per station is introduced when the MW satellite biases for all satellites are introduced as constraints into the system.
All bias constraints to handle the rank defect in modeling equations (11) or (12) are avoided if one additional ambiguity constraint is introduced instead. However, this additional ambiguity constraint is not arbitrary. It is chosen such that the double difference relation (13) is fulfilled. However, (13) does not contain the unmodeled multipath and just determines a float value for the DD ambiguity. Thus, deriving an integer DD ambiguity value from (13) is prone to error.
To better distinguish between arbitrary ambiguity constraints and ambiguity constraints that have to fulfill the DD ambiguity relation (13), we usually call the second kind of constraints ambiguity fixes. While constraints are arbitrary and do not depend on the actual observations, fixes do. Constraints cannot be made to a wrong value, fixes can. Which of the ambiguities can be constrained to an arbitrary value is described in Part 7.6.
Part 7.5 MW Bias Process: WL Ambiguity Constraints
FIG. 14 shows a process 1700 with the addition of one or more WL ambiguity constraints to the process of FIG. 13, which can similarly be added to the embodiments shown in FIG. 9, FIG. 11 and FIG. 12. At least one WL ambiguity integer constraint 1705 as in Equation (33) is put into the processor 1225 to further reduce the rank defect in modeling equations (11) or (12). As for FIG. 13, the correct number of arbitrary ambiguity constraints in a network with i=1, . . . , m stations and j=1, . . . , n satellites, where all satellites are seen at all stations, is m+n−1. However, in a global network with reference stations distributed over the whole Earth not all satellites are seen at all stations. For this case, choosing the correct number of arbitrary ambiguity constraints and determining the exact combinations that are not restricted by the DD ambiguity relation (13) is described in Part 7.6.
Although the constrained ambiguities that are not restricted by the DD ambiguity relation (13) could be constrained to any value in order to reduce the rank effect in the modeling equations (11) or (12), it is desirable to constrain these ambiguities to an integer value so that the integer nature of the ambiguities comes into the system. This helps later on when for the remaining unconstrained float ambiguities, integer values are searched that are consistent with (13) and to which these ambiguities can be fixed.
In a Kalman filter approach where equations (11) or (12) are extended by equations for the initial values of the parameters, there is always a well defined float solution for all parameters (that has, however, a large variance if the initial variances of the parameters have also been chosen with large values). In this case it is reasonable to constrain the ambiguities to the closest integer of their Kalman filter float solution since this disturbs the filter in the least way and gives the solution that is closest to the initial values of the parameters. It is also advantageous to constrain the ambiguities one after the other, looking up after each constraint the updated float ambiguity of the next ambiguity to be constrained. Such a procedure helps to stabilize the filter in cases of network outages where many ambiguities are lost, receiver biases are modeled as white noise parameters and just already converged satellite biases have a defined value.
Part 7.6 MW Bias Process: Determining WL Ambiguity Constraints
FIG. 15 shows a process 1800 with the addition of determining one or more WL ambiguity constraints for the process of FIG. 14 so as to avoid under- and over-constraining of the modeling equations (11) or (12).
Under-constraining means that too few constraints have been introduced to overcome the rank defect in (11) or (12). Over-constraining means that arbitrary constraints have been introduced that are inconsistent with the DD ambiguity relation (13). Thus, a system can be at the same time over- and under-constrained.
The MW observation input 1420 defines an observation graph, 1805, i.e. a number of edges given by observed station-satellite links. Based on this graph a spanning tree (ST) 1815 is generated by an ST generator 1810 that connects all stations and satellites (in the undifferenced case (11)) or just all satellites (in the between satellite single differenced case (12)) without introducing loops. The resulting ST 1815 defines the WL ambiguity constraints 1705, i.e., which WL ambiguities are constrained.
FIG. 16A shows at 1900 how observed station-satellite links can be interpreted as an abstract graph, i.e. a number of vertices connected by edges. The stations at the bottom of FIG. 16A and the satellites at the top of FIG. 16A are identified as vertices and the station-satellite pairs (each pair corresponding to observations at a station of a satellite's signals) as edges. The abstract graph 1910 of FIG. 16B does not distinguish any more between stations and satellites and instead shows the edges as links between vertices.
In graph theory a tree is a graph without closed loops. An example is shown at 1920 in FIG. 16C, where the tree is marked with bold lines. A spanning tree on a graph is a tree that connects (or spans) all vertices, as in FIG. 16C.
Instead of building the spanning tree based on the current observation graph, it can alternatively be based on all station-satellite ambiguities that are currently in the filter. These ambiguities correspond to station-satellite links that were observed in the past but that are not necessarily observed anymore in the current epoch. We call the station-satellite links defined by the filter ambiguities the filter graph. Notice that it is a bit arbitrary for how long ambiguities are kept in the filter when they are no longer observed. If a fixed slot management for the ambiguities in the filter is used that holds a maximal number of ambiguities for each station so that a newly observed ambiguity on a rising satellite will throw out the oldest ambiguity if all slots are already used, this time of keeping a certain ambiguity does not have to be specified. It will be different for each satellite on each station. However, such a slot management guarantees that after some time each station holds the same number of ambiguities.
In general the filter graph contains more station-satellite links than the observation graph. It contains in addition stations that are not observed anymore (which often occurs for short time periods in a global network), satellites no longer observed at any station (e.g. since a satellite became unhealthy for a short time period), or just station-satellite links that fall below the elevation cutoff. Working on the filter graph is of special importance when the later described ambiguity fixing is also done on the filter graph and ambiguity constraints and fixes are introduced on the original filter and not on a filter copy.
In the single-differenced observation graph 1960 of FIG. 16G two satellites are usually connected by several edges since the two satellites are usually observed at several stations. Each edge connecting two satellites corresponds to an (at least in the past) observed satellite-station-satellite link, i.e., a single-difference observation. Of course, also the SD filter graph 1970 of FIG. I 6H contains more edges than the SD observation graph 1960.
Constraining the ambiguities determined by a spanning tree over the observation or the filter graph can avoid under- and over-constraining of modeling equations (11) or (12). This is illustrated for the undifferenced case in FIG. 16D. A spanning tree (ST) on the observation graph or filter graph connects all vertices without introducing loops (see emphasized edges in FIG. 16C). FIG. 16D shows at 1930 in addition to the spanning tree edges (in dark grey) that are constrained to an arbitrary integer value, also a single satellite bias constraint S1 depicted in dark grey. The satellite bias is visualized as a circle since its contribution to the observation is the same for all receiver observations of this satellite.
Constraining the ST edges together with one additional satellite bias S1 allows to resolve the underdetermined linear system of equations (11): The observation R1-S1 together with the satellite bias constraint S1 and the ambiguity constraint R1-S1 allows to uniquely solve for receiver bias R1 (compare equation (11)). Once receiver bias R1 is known, the observation R1-S2 together with the ambiguity constraint R1-S2 allows to solve for satellite bias S2. In the same way all other receiver and satellite biases can be computed with the help of the ST constrained ambiguities. The spanning property of the ST ensures that all satellite and receiver biases are reached while the tree property ensures that there are no loops that would constrain a double difference observation (13). Once all satellite and receiver biases are known, the remaining ambiguities (e.g. R2-S1, R2-S4 and R2-S5 in FIG. 16D) can be directly computed from the remaining observations one after the other.
In the SD case shown in FIGS. 16G and 16H the argumentation is quite similar. Constraining one SD satellite bias to an arbitrary value (e.g., constraining the bias of a physical reference satellite to 0), the SD satellite bias of the next satellite can be determined with the help of an SD observation between the first and second satellite and the ambiguity constraint from the SD spanning tree between the two satellites (compare equation (12)). Once the second satellite bias is known the third bias can be calculated. In the same way all other satellite biases are determined with the help of the SD spanning tree constraints. By adding one ambiguity constraint per station to an arbitrary satellite, all remaining SD ambiguities (single-differenced against a station-specific reference satellite) in the filter can be resolved one after the other.
The relation underlying this description between an undifferenced (=zero-differenced (ZD)) spanning tree 1975 and a SD spanning tree 1980 is depicted in FIG. 16I. Connecting each station with a single satellite by introducing one ambiguity constraint per station and adding to these constraints the ones given by an ST on the SD observation graph (or filter graph), defines the same constraints that are given by an ST on a ZD observation graph (or filter graph) 1985. Building up a spanning tree on a graph is not a unique process. For a given graph there exist many trees that span the graph. To make the generation of a spanning tree more unique the use of a minimum spanning tree (with respect to some criterion) is proposed in Part 7.7.
Part 7.7 MW Bias Process: Minimum Spanning Tree
FIG. 18A shows at 2110 a spanning tree (ST) on an undifferenced observation graph. FIG. 18B shows at 2120 a minimum spanning tree (MST) (Cormen, Leiserson, Rivest, & Stein, 2001) on the undifferenced observation graph of FIG. 18A. FIG. 17 shows the ST generator 1810 of FIG. 15 replaced with an MST generator 2010. For building up an MST on a graph, each edge has an edge weight resulting in a so-called weighted graph. The MST is defined as the spanning tree with the overall minimal edge weight. The edge weight can be assigned in any of a variety of ways. One possible way is based on the current receiver-satellite geometry and therefore use the station positions 1250 and the satellite positions 1245 as inputs. The connections between the coarse receiver positions 1250, the broadcast satellite orbits 1245 and the MST generator 2010 are depicted in FIG. 17.
The edges in the undifferenced observation graph or filter graph are given by station-satellite links. In some embodiments the edge weight is the geometric distance from receiver to satellite or a satellite-elevation-angle-related quantity (like the inverse elevation angle or the zenith distance (=90°-elevation)).
The edges in the single-differenced observation graph or filter graph are given by satellite-receiver-satellite links connecting two different satellites over a station. In some embodiments the edge weight is the geometric distance from satellite to receiver to satellite, or a combination of the elevations under which the two satellites are seen at the receiver. In some embodiments the combination of the two elevations is the sum of the inverse elevations, the sum of the zenith distances, the minimal inverse elevation, or the minimal zenith distance.
In FIG. 18A and FIG. 18B the ST and MST edges are marked with an “X.” The ST 2110 in FIG. 18A and the MST 2120 in FIG. 18B are identical, and the ST 2130 in FIG. 18C and the MST 2140 in FIG. 18D are identical, reflecting the fact that each ST can be obtained as an MST by definition of suitable edge weights.
An MST is well defined (i.e. it is unique) if all edge weights are different. Assigning the weights to the edges allows control on how the spanning tree is generated. In embodiments using geometrical based weights the MST is generated in a way that highest satellites (having smallest geometrical distance and smallest zenith distance, or smallest value of 1/elevation) are preferred. These are also the station-satellite links that are least influenced by the unmodeled multipath. In these embodiments the weights prefer those edges for constraining which should shift the least multipath into other links when constraining the ambiguities to an integer value. In embodiments using low elevation station-satellite links with high multipath for constraining, the multipath is shifted to links with higher elevation satellites. This can result in the counter-intuitive effect that ambiguities on high elevation satellites become more difficult to fix to an integer value.
Generating an MST on a given weighted graph is a standard task in computer science for which very efficient algorithms exist. Examples are Kruskal's, Prim's, and Boruvka's algorithms.
FIG. 19 shows an alternative way of choosing the edge weights of the observation graph or filter graph on which the MST (defining the constrained ambiguities) is generated. In some embodiments, the edge weights are derived from the ambiguity information in the filter, i.e. from the values of the WL ambiguities 1435, or from the variances 2210 of the WL ambiguities, or from both.
A particular interesting edge weight used in some embodiments is the distance of the corresponding ambiguity to its closest integer value. In this way the MST chooses the ambiguities for constraining that span the observation/filter graph and that are as close as possible to integer. Thus the states in the processor are influenced in a minimal way by the constraints to integer. An additional advantage is that the constraints of the last epoch will also be favored in the new epoch since their distance to integer is zero which prevents from over-constraining the filter when the constraints are directly applied to the filter and no filter copy is used. The same goal is reached by using the variance of the ambiguity as an edge weight. Constrained ambiguities have a variance of the size of the constraining variance, e.g., 10−30 m2, and are thus favored in the MST generation in some embodiments. In some embodiments each combination of ambiguity distance to integer and ambiguity variance is used as an edge weight. In some embodiments the combination of an edge weight derived from the station-satellite geometry and from ambiguity information is used. In some embodiments for example, in the first epoch a geometrically motivated weight is chosen (to minimize effects from unmodeled multipath and to ensure that constraints stay in the system for a long time) and in later epochs an ambiguity-derived weight (to avoid over-constraining) is chosen.
Part 7.8 MW Bias Process: WL Ambiguity Fixing
FIG. 20A shows fixing of the WL ambiguities before they are sent out (e.g. for use in the phase clock processor 335 or orbit processor 300). In some embodiments the WL ambiguity state values 1435 are forwarded together with at least the WL ambiguity variances 2210 from the filter to an ambiguity fixer 2305 module. The ambiguity fixer module 2305 outputs the fixed WL ambiguities 2310.
The ambiguity fixer module 2305 can be implemented in a variety of ways:
Threshold Based Integer Rounding:
In some embodiments a simple fixer module checks each individual ambiguity to determine whether it is closer to integer than a given threshold (e.g., closer than a=0.12 WL cycles). If also the standard deviation of the ambiguity is below a second given threshold (e.g, σ=0.04 so that a=3σ) the ambiguity is rounded to the next integer for fixing. Ambiguities that do not fulfill these fixing criteria remain unfixed. In some embodiments the satellite elevation angle corresponding to the ambiguity is taken into account as an additional fixing criterion so that e.g. only ambiguities above 15° are fixed.
Optimized Sequence, Threshold Based Integer Bootstrapping:
A slightly advanced approach used in some embodiments fixes ambiguities in a sequential way. After the fix of one component of the ambiguity vector, the fix is reintroduced into the filter so that all other not yet fixed ambiguity components are influenced over their correlations to the fixed ambiguity. Then the next ambiguity is checked for fulfilling the fixing criteria of distance to integer and standard deviation. In some embodiments the sequence for checking ambiguity components is chosen in an optimal way by ordering the ambiguities with respect to a cost function, e.g. distance to integer plus three times standard deviation. In this way the most reliable ambiguities are fixed first. After each fix the cost function for all ambiguities is reevaluated. After that, again the ambiguity with the smallest costs is checked for fulfilling the fixing criteria. The fixing process stops when the best ambiguity fixing candidate does not fulfill the fixing criteria. All remaining ambiguities remain unfixed.
Integer Least Squares, (Generalized) Partial Fixing:
A more sophisticated approach used in some embodiments takes the covariance information of the ambiguities from the filter into account. The best integer candidate N1 is the closest integer vector to the least squares float ambiguity vector {circumflex over (N)}εRv in the metric defined by the ambiguity part of the (unconstrained) state covariance matrix P{circumflex over (N)}εRv×Rv, both obtained from the filter, i.e.




  
    
      
        
          N
          1
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              
                N
                ∈
                
                  Z
                  v
                
              
            
            ⁢
            
              
                
                  (
                  
                    N
                    -
                    
                      N
                      ^
                    
                  
                  )
                
                t
              
              ⁢
              
                
                  P
                  
                    N
                    ^
                  
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    N
                    -
                    
                      N
                      ^
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        39
        )
      
    
  




However, since the observation input to the filter is, due to measurement noise, only precise to a certain level also the resulting estimated float ambiguity vector {circumflex over (N)} is only reliable to a certain level. Then a slightly different {circumflex over (N)} may lead to a different NεZv that minimizes (39). Therefore in some embodiments the best integer candidate is exchanged with e.g. the second best integer candidate by putting other noisy measurements (e.g. from other receivers) into the filter. To identify the reliable components in the ambiguity vector that can be fixed to a unique integer with a high probability, the minimized quantity (N−{circumflex over (N)})jP{circumflex over (N)}−1(N−{circumflex over (N)}) is compared in some embodiments under the best integer candidates in a statistical test like the ratio test. If Ni is the i'th best (i>1) integer candidate this implies that (Ni−{circumflex over (N)})jP{circumflex over (N)}−1(Ni−{circumflex over (N)})>




  
    
      
        
          
            
              
                
                  (
                  
                    
                      N
                      i
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
                t
              
              ⁢
              
                
                  P
                  
                    N
                    ^
                  
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      N
                      i
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
              
            
            >
            
              
                
                  (
                  
                    
                      N
                      1
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
                t
              
              ⁢
              
                
                  P
                  
                    N
                    ^
                  
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      N
                      1
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
              
            
          
          ,
          or
        
        ⁢
        
          

        
        ⁢
        
          
            F
            i
          
          :=
          
            
              
                
                  
                    (
                    
                      
                        N
                        i
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                  t
                
                ⁢
                
                  
                    P
                    
                      N
                      ^
                    
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        N
                        i
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                
              
              
                
                  
                    (
                    
                      
                        N
                        1
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                  t
                
                ⁢
                
                  
                    P
                    
                      N
                      ^
                    
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        N
                        1
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                
              
            
            >
            1
          
        
      
    
    
      
        (
        40
        )
      
    
  




The quotient in (40) is a random variable that follows an F-distribution. Some embodiments basically follow the description in (Press, Teukolsky, Vetterling, & Flannery, 1996). The probability that Fi would be as large as it is if (Ni−{circumflex over (N)})jP{circumflex over (N)}−1(Ni−{circumflex over (N)}) is smaller than (N1−{circumflex over (N)})jP{circumflex over (N)}−1(N1−{circumflex over (N)}) is denoted as Q(Fi|v,v) whose relation to the beta function and precise algorithmic determination is given in (Press, Teukolsky, Vetterling, & Flannery, 1996). In other words, Q(Fi|v,v) is the significance level at which the hypothesis (Ni−{circumflex over (N)})jP{circumflex over (N)}−1(Ni−{circumflex over (N)})<(N1−{circumflex over (N)})jP{circumflex over (N)}−1(N1−{circumflex over (N)}) can be rejected. Thus each candidate for which e.g. Q(Fi|v,v)≧0.05 can be declared as comparable good as N1. The first candidate i0+1 for which Q(Fi|v,v)<0.05 is accepted as significantly worse than N1.
Then all the components in the vectors N1, N2, . . . , Nt0 that have the same value can be taken as reliable integer fixes. The components in which these ambiguity vectors differ should not be fixed to an integer. However, among these components there can exist certain linear combinations that are the same for all vectors N1, N2, . . . , Nt0. These linear combinations can also be reliably fixed to an integer.
In some embodiments determination of the best integer candidate vectors is performed via the efficient LAMBDA method (Teunissen, 1995).
Best Integer Equivariant Approach:
In some embodiments the components of the high-dimensional ambiguity vector are fixed to float values that are given by a linear combination of the best integer candidates. FIG. 20B shows the WL ambiguities are sent out (e.g. for use in the phase clock processor 335 or orbit processor 300).
In these embodiments the WL ambiguity state values 1435 are forwarded together with the ambiguity variance-covariance matrix 2210 from the filter to an integer ambiguity searcher module 2320. Integer ambiguity searcher module 2320 outputs a number of integer ambiguity candidate sets 2323 that are then forwarded to an ambiguity combiner module 2325 that also gets the least squares ambiguity float solution 1435 and the ambiguity variance-covariance matrix 2210 from the filter as an input. The least squares ambiguity float solution 1435 is used together with the ambiguity variance-covariance matrix 2210 for forming a weight for each integer ambiguity candidate. In the ambiguity combiner module 2325 the weighted integer ambiguity candidates are summed up. The output is a fixed WL ambiguity vector 2330 that can then be forwarded to the phase clock processor 335 and orbit processor 330.
To derive the weights for the integer ambiguity vectors, note that the least squares ambiguity float vector {circumflex over (N)} is the expectation value of a multidimensional Gaussian probability function p(N), i.e.




  
    
      
        
          
            N
            ^
          
          =
          
            
              ∫
              
                N
                ∈
                
                  R
                  v
                
              
            
            ⁢
            
              N
              ⁢
              
                
              
              ⁢
              
                p
                ⁡
                
                  (
                  N
                  )
                
              
              ⁢
              
                d
                N
              
              ⁢
              
                
              
              ⁢
              with
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            p
            ⁡
            
              (
              N
              )
            
          
          =
          
            
              e
              
                
                  -
                  
                    1
                    2
                  
                
                ⁢
                
                  
                    (
                    
                      N
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                  t
                
                ⁢
                
                  
                    P
                    
                      N
                      ^
                    
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      N
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                
              
            
            
              
                ∫
                
                  N
                  ∈
                  
                    R
                    v
                  
                
              
              ⁢
              
                
                  e
                  
                    
                      -
                      
                        1
                        2
                      
                    
                    ⁢
                    
                      
                        (
                        
                          N
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                      t
                    
                    ⁢
                    
                      
                        P
                        
                          N
                          ^
                        
                        
                          -
                          1
                        
                      
                      ⁡
                      
                        (
                        
                          N
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                    
                  
                
                ⁢
                
                  d
                  N
                
              
            
          
        
      
    
    
      
        (
        41
        )
      
    
  




Thus an ambiguity expectation value that recognizes the integer nature of the ambiguities is given by




  
    
      
        
          N
          ⋓
        
        :=
        
          
            
              ∑
              
                N
                ∈
                
                  Z
                  v
                
              
            
            ⁢
            
              N
              ⁢
              
                
              
              ⁢
              
                
                  p
                  ⋓
                
                ⁡
                
                  (
                  N
                  )
                
              
              ⁢
              
                
              
              ⁢
              with
              ⁢
              
                
              
              ⁢
              
                
                  p
                  ⋓
                
                ⁡
                
                  (
                  N
                  )
                
              
            
          
          =
          
            
              e
              
                
                  -
                  
                    1
                    2
                  
                
                ⁢
                
                  
                    (
                    
                      N
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                  t
                
                ⁢
                
                  
                    P
                    
                      N
                      ^
                    
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      N
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                
              
            
            
              
                ∑
                
                  N
                  ∈
                  
                    Z
                    v
                  
                
              
              ⁢
              
                e
                
                  
                    -
                    
                      1
                      2
                    
                  
                  ⁢
                  
                    
                      (
                      
                        N
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                    t
                  
                  ⁢
                  
                    
                      P
                      
                        N
                        ^
                      
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        N
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        42
        )
      
    
  




Since the summation over the whole integer grid NεZv cannot be computed in practice, the sum is in some embodiments restricted to the best integer ambiguity candidates




  
    
      
        
          
            N
            ⋓
          
          ≈
          
            
              ∑
              
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  with
                  ⁢
                  
                    
                  
                  ⁢
                  
                    F
                    i
                  
                
                <
                
                  1
                  +
                  ɛ
                
              
            
            ⁢
            
              
                N
                i
              
              ⁢
              
                
                  p
                  ⋓
                
                ⁡
                
                  (
                  
                    N
                    i
                  
                  )
                
              
              ⁢
              
                
              
              ⁢
              with
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            
              p
              ⋓
            
            ⁡
            
              (
              
                N
                i
              
              )
            
          
          ≈
          
            
              e
              
                
                  -
                  
                    1
                    2
                  
                
                ⁢
                
                  
                    (
                    
                      
                        N
                        i
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                  t
                
                ⁢
                
                  
                    P
                    
                      N
                      ^
                    
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        N
                        i
                      
                      -
                      
                        N
                        ^
                      
                    
                    )
                  
                
              
            
            
              
                ∑
                
                  
                    i
                    ⁢
                    
                      
                    
                    ⁢
                    with
                    ⁢
                    
                      
                    
                    ⁢
                    
                      F
                      1
                    
                  
                  <
                  
                    1
                    +
                    ɛ
                  
                
              
              ⁢
              
                e
                
                  
                    -
                    
                      1
                      2
                    
                  
                  ⁢
                  
                    
                      (
                      
                        
                          N
                          i
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                    t
                  
                  ⁢
                  
                    
                      P
                      
                        N
                        ^
                      
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        
                          N
                          i
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        45
        )
      
    
  




with Fi from (40). The {hacek over (p)}(Ni) are the desired weights for the best integer ambiguity candidates. Thereby a reasonable value for ε follows from the following consideration. In the sum in (42) ambiguity vectors N can be neglected if the relative weight to the largest {hacek over (p)}(N) is small, i.e. if {hacek over (p)}(N)/{hacek over (p)}(N1)≦δ with e.g. δ=e−q; q=25. In other words, all ambiguity vectors with {hacek over (p)}(N)/{hacek over (p)}(N1)>δ have to be recognized. Writing out this condition for N=Ni with the definition for {hacek over (p)}(N) from (42) results in




  
    
      
        
          
            
              
                
                  
                    
                      
                    
                    ⁢
                    
                      
                        δ
                        <
                        
                          
                            
                              p
                              ⋓
                            
                            ⁡
                            
                              (
                              
                                N
                                i
                              
                              )
                            
                          
                          
                            
                              p
                              ⋓
                            
                            ⁡
                            
                              (
                              
                                N
                                1
                              
                              )
                            
                          
                        
                      
                      =
                      
                      ⁢
                      
                        
                          e
                          
                            
                              -
                              
                                1
                                2
                              
                            
                            ⁢
                            
                              
                                (
                                
                                  
                                    N
                                    i
                                  
                                  -
                                  
                                    N
                                    ^
                                  
                                
                                )
                              
                              t
                            
                            ⁢
                            
                              
                                P
                                
                                  N
                                  ^
                                
                                
                                  -
                                  1
                                
                              
                              ⁡
                              
                                (
                                
                                  
                                    N
                                    i
                                  
                                  -
                                  
                                    N
                                    ^
                                  
                                
                                )
                              
                            
                          
                        
                        
                          e
                          
                            
                              -
                              
                                1
                                2
                              
                            
                            ⁢
                            
                              
                                (
                                
                                  
                                    N
                                    1
                                  
                                  -
                                  
                                    N
                                    ^
                                  
                                
                                )
                              
                              t
                            
                            ⁢
                            
                              
                                P
                                
                                  N
                                  ^
                                
                                
                                  -
                                  1
                                
                              
                              ⁡
                              
                                (
                                
                                  
                                    N
                                    1
                                  
                                  -
                                  
                                    N
                                    ^
                                  
                                
                                )
                              
                            
                          
                        
                      
                    
                  
                
              
              
                
                  
                    =
                    
                    ⁢
                    
                      e
                      
                        
                          
                            1
                            2
                          
                          ⁢
                          
                            
                              (
                              
                                
                                  N
                                  1
                                
                                -
                                
                                  N
                                  ^
                                
                              
                              )
                            
                            t
                          
                          ⁢
                          
                            
                              P
                              
                                N
                                ^
                              
                              
                                -
                                1
                              
                            
                            ⁡
                            
                              (
                              
                                
                                  N
                                  1
                                
                                -
                                
                                  N
                                  ^
                                
                              
                              )
                            
                          
                        
                        -
                        
                          
                            1
                            2
                          
                          ⁢
                          
                            
                              (
                              
                                
                                  N
                                  i
                                
                                -
                                
                                  N
                                  ^
                                
                              
                              )
                            
                            t
                          
                          ⁢
                          
                            
                              P
                              
                                N
                                ^
                              
                              
                                -
                                1
                              
                            
                            ⁡
                            
                              (
                              
                                
                                  N
                                  i
                                
                                -
                                
                                  N
                                  ^
                                
                              
                              )
                            
                          
                        
                      
                    
                  
                
              
            
            ⁢
            
              

            
            ⇔
            
              ln
              ⁢
              
                
              
              ⁢
              δ
            
          
          =
          
            
              
                -
                q
              
              <
              
                
                  
                    1
                    2
                  
                  ⁢
                  
                    
                      (
                      
                        
                          N
                          1
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                    t
                  
                  ⁢
                  
                    
                      P
                      
                        N
                        ^
                      
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        
                          N
                          1
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                  
                
                -
                
                  
                    1
                    2
                  
                  ⁢
                  
                    
                      (
                      
                        
                          N
                          i
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                    t
                  
                  ⁢
                  
                    
                      P
                      
                        N
                        ^
                      
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        
                          N
                          i
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                  
                
              
            
            ⁢
            
              

            
            ⇔
            
              
                
                  -
                  q
                
                
                  
                    1
                    2
                  
                  ⁢
                  
                    
                      (
                      
                        
                          N
                          1
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                    t
                  
                  ⁢
                  
                    
                      P
                      
                        N
                        ^
                      
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      
                        
                          N
                          1
                        
                        -
                        
                          N
                          ^
                        
                      
                      )
                    
                  
                
              
              <
              
                1
                -
                
                  
                    
                      1
                      2
                    
                    ⁢
                    
                      
                        (
                        
                          
                            N
                            i
                          
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                      t
                    
                    ⁢
                    
                      
                        P
                        
                          N
                          ^
                        
                        
                          -
                          1
                        
                      
                      ⁡
                      
                        (
                        
                          
                            N
                            i
                          
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                    
                  
                  
                    
                      
                        1
                        2
                      
                      ⁢
                      
                        
                          (
                          
                            
                              N
                              1
                            
                            -
                            
                              N
                              ^
                            
                          
                          )
                        
                        t
                      
                      ⁢
                      
                        
                          P
                          
                            N
                            ^
                          
                          
                            -
                            1
                          
                        
                        ⁡
                        
                          (
                          
                            
                              N
                              1
                            
                            -
                            
                              N
                              ^
                            
                          
                          )
                        
                      
                    
                    
                      }
                      
                        =
                        
                          :
                          
                            F
                            i
                          
                        
                      
                    
                  
                
              
            
            ⁢
            
              

            
            ⁢
            
              
            
            ⇔
            
              
                F
                i
              
              <
              
                1
                +
                
                  q
                  
                    
                      1
                      2
                    
                    ⁢
                    
                      
                        (
                        
                          
                            N
                            1
                          
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                      t
                    
                    ⁢
                    
                      
                        P
                        
                          N
                          ^
                        
                        
                          -
                          1
                        
                      
                      ⁡
                      
                        (
                        
                          
                            N
                            1
                          
                          -
                          
                            N
                            ^
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        Thus
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          ɛ
          :=
          
            q
            
              
                1
                2
              
              ⁢
              
                
                  (
                  
                    
                      N
                      1
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
                t
              
              ⁢
              
                
                  P
                  
                    N
                    ^
                  
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      N
                      1
                    
                    -
                    
                      N
                      ^
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        
      
    
  




is a reasonable value for ε.

The {hacek over (p)}(Ni) are the desired weights for the best integer ambiguity candidates. The ambiguity candidates themselves can be determined in an efficient way with the LAMBDA method (Teunissen, 1995).
Part 7.9 MW Bias Process: Using Fixed WL Ambiguities
FIG. 21A shows an embodiment 2400. In this way the estimated MW biases 1430 are made consistent with the fixed WL ambiguities 2330. These fixed-nature MW satellite biases from the network are transferred to the rover receiver where they help in fixing WL ambiguities.
The fixed WL ambiguities 2330 can be introduced into the processor 1225 in several different ways. FIG. 21B, FIG. 21C and FIG. 21D show details of three possible realizations of the processor 1225 that differ in the manner of feeding back the fixed WL ambiguities into the MW bias estimation process.
In the embodiment 2400 the processor 1225 comprises a single sequential filter 2410 (such as a Kalman filter) that holds states 2415 for satellite MW biases, states 2420 for WL ambiguities and—in case of the undifferenced observation model (11)—also states 2425 for receiver MW biases. In the single differenced (SD) observation model (12) no receiver bias states occur. In addition to these states, which contain the values of the least-squares best solution of the model parameters for the given observations, the filter also contains variance-covariance (vc) information 2430 of the states. The vc-information is usually given as a symmetric matrix and shows the uncertainty in the states and their correlations. It does not directly depend on the observations but only on the observation variance, process noise, observation model and initial variances. However, since the observation variance is derived from the observations when smoothing is enabled (see Part 7.3), there can also be an indirect dependence of the vc-matrix 2430 on the observations.
The filter input comprises MW observations (e.g., smoothed MW observations 1420) and satellite MW-bias process noise 1240 (see Part 7.2), a MW bias constraint 1605 (see Part 7.4), integer WL ambiguity constraints 1705 (see Part 7.5) and, optionally, shifts from a bias and ambiguity shifter 24 (discussed in Part 7.10).
The filter output of primary importance comprises the satellite MW biases 1430, the (float) WL ambiguities 1430 and the (unconstrained) WL ambiguity part 2210 of the vc-matrix 2430. The ambiguity information is forwarded to an ambiguity fixer module (see Part 7.8) that outputs (float or integer) fixed WL ambiguities 2310. These fixed WL ambiguities 2310 are output for use in the orbit processor 330 and the phase clock processor 335. In addition, the fixed WL ambiguities 2310 are reintroduced into the filter by adding them as pseudo observations with a very small observation variance (of e.g. 10−30 m2). The resulting satellite MW biases 1430 are output to the rover and, optionally, to the orbit processor 330 and the phase clock processor 335. Since they are consistent with the fixed WL ambiguities, we call them fixed MW biases.
Note that, if an ambiguity were fixed to a wrong integer, the wrong ambiguity would remain in the filter 2410 until a cycle slip on that ambiguity occurs or it is thrown out of the filter (such as when it has not been observed anymore for a certain time period or another ambiguity has taken over its ambiguity slot in the filter 2410). If this were to occur the MW biases would be disturbed for a long time. However, an advantage of this approach is that also ambiguity fixes remain in the filter that have been fixed to integer when the satellites were observed at high elevations but having meanwhile moved to low elevations and could not be fixed anymore or that are even no longer observed. These ambiguity fixes on setting satellites can stabilize the solution of MW biases a lot.
Note also that a float ambiguity should not be fixed with a very small variance (of e.g. 10−30 m2) in the single filter 2410 since in this way new observations cannot improve anymore the ambiguity states by bringing them closer to an integer. In some embodiments the float ambiguity is fixed with a variance that depends on its distance to integer so that the observation variance tends to zero when the distance to the closest integer tends to zero and tends to infinity when the distance to the closest integer tends to 0.5. However, for fixing float ambiguities the approaches used in the embodiments of FIG. 21C and FIG. 21D are more suitable.
In the embodiment 2440 of FIG. 21C the processor 1225 comprises two sequential filters 2445 and 2450 where the process flow for the first filter 2445 is almost identical with the filter 2410 of FIG. 21B. The difference is that no fixed WL ambiguities 1430 are fed back into filter 2445. Instead, each time new fixed WL ambiguities 2310 are available (e.g. after each observation update), a filter copy 2450 of the first filter 2445 is made and then the fixed WL ambiguities 2310 are introduced as pseudo-observations into the filter copy 2450. The original filter 2445 thus remains untouched so that no wrong fixes can be introduced into it. The filter copy 2450 outputs fixed satellite MW biases 2455 (e.g., as MW biases 345).
A disadvantage of this approach is that only currently observed ambiguities can be fixed and introduced into the filter copy 2550. All prior ambiguity fixes are lost. However, this is a preferred way of processing when the whole ambiguity space is analyzed at once as it is done in the integer least squares partial fixing and integer candidate combination approaches (see Part 7.8).
Embodiment 2460 of FIG. 21D shows an alternative approach to feed the fixed WL ambiguities into the estimation process. Here the fixed WL ambiguities 2310 are forwarded to an ambiguity subtracter module 2665 that reduces the MW observations 1420 by the ambiguities. The resulting ambiguity-reduced MW observations 2670 are put into a second filter 2475 that does not have any ambiguity states but only satellite MW bias states 2480 and—in the undifferenced approach (11)—also receiver MW bias states 2485. This second filter 2475 just needs a single MW bias constraint 2490 and process noise on satellite MW biases 2480 as additional inputs. In case biases are shifted in the first filter 2440 they also have to be shifted in the second filter 2475.
The second filter 2475 outputs fixed satellite MW biases 2450.
Note that in this approach the ambiguities are not fixed with a very small observation variance (of e.g. 10−30 m2) but only with the usual observation variance of the MW observations. By inserting observations over time with the same fixed ambiguity, the weak ambiguity constraint is more and more tightened. All prior ambiguity fixes remain in the filter to some extent. A wrong fix that is detected after some time will be smoothed out. Thus it is also quite reasonable to put float-ambiguity-reduced MW observations into the filter.
Since the second filter 2475 does not have ambiguity states that build the majority of states in the first filter, the second filter 2475 is very small and can be updated at a very high rate of, e.g. every second, without running into performance problems. Thus in some embodiments the original MW observations without any prior smoothing are input into this filter.
Part 7.10 MW Bias Process: Shifting MW Biases
FIG. 22A shows an embodiment 2500 in which the process described in Part 7.8 is augmented with an external satellite MW bias shifter module 2505. The term external means, in contrast to the shifting module shown in FIG. 22C where the shifting is applied on the filter. Note that all the ambiguity constraining and fixing related steps as well as the correction and smoothing steps are optional.
The bias shifter module 2505 shifts the satellite MW biases 1430 to produce satellite MW biases 2510 in a desired range of at least one WL cycle. This is possible since as seen from Equation (11) a shift in a satellite bias by n WL cycles are absorbed by the WL ambiguities corresponding to this satellite, e.g.




  
    
      
        
          
            
              
                
                  Φ
                  
                    i
                    ,
                    WL
                  
                  j
                
                -
                
                  P
                  
                    i
                    ,
                    NL
                  
                  j
                
              
              =
              
              ⁢
              
                
                  b
                  
                    i
                    ,
                    MW
                  
                
                -
                
                  b
                  MW
                  j
                
                +
                
                  
                    λ
                    WL
                  
                  ⁢
                  
                    N
                    
                      i
                      ,
                      WL
                    
                    j
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  b
                  
                    i
                    ,
                    MW
                  
                
                -
                
                  
                    (
                    
                      
                        b
                        MW
                        j
                      
                      +
                      
                        n
                        ⁢
                        
                          
                        
                        ⁢
                        
                          λ
                          WL
                        
                      
                    
                    )
                  
                  
                    }
                    
                      =
                      
                        :
                        
                          
                            b
                            ~
                          
                          MW
                          j
                        
                      
                    
                  
                
                +
                
                  
                    λ
                    WL
                  
                  ⁢
                  
                    
                      (
                      
                        
                          N
                          
                            i
                            ,
                            WL
                          
                          j
                        
                        -
                        n
                      
                      )
                    
                    
                      }
                      
                        =
                        
                          :
                          
                            
                              N
                              ~
                            
                            
                              i
                              ,
                              WL
                            
                            j
                          
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        46
        )
      
    
  




Similar shifts are possible for receiver biases.

FIG. 22B shows the impact of shifting MW biases as in equation (46). Each MW combination is depicted in FIG. 22B as the distance between a receiver (e.g., one of receivers 2525, 2530, 2535, 2540) and a satellite 2545. This distance is represented by the sum of a receiver bias (which is the same for all satellites and therefore visualized as a circle around the receiver such as 2550), a satellite bias (that is the same for all receivers and therefore visualized as a circle 2555 around the satellite) and an ambiguity (that depends on the receiver-satellite pair and is therefore visualized as a bar such as bar 2560 for the pairing of receiver 2525 and satellite 2545). Reducing the satellite bias by the wavelength of one WL cycle (as depicted by smaller circle 2565) increases all related ambiguities by the wavelength of one WL cycle. The receiver biases are untouched by this operation.
An advantage of shifting satellite MW biases into a defined range is that in this way the biases can be encoded with a fixed number of bits for a given resolution. This allows to reduce the necessary bandwidth for transferring satellite MW biases to the rover which is in some embodiments done over expensive satellite links.
Although all satellite biases bMWj/λWL can be mapped for a certain fixed time e.g. into the range [−0.5, +0.5[it is preferable to extend this range e.g. to [−1, +1[in order to avoid frequent jumps in the MW satellite biases when they leave the defined range. Due to the oscillating behavior of MW satellite biases, the satellite biases at the border of the defined range close to −0.5 or +0.5 might often leave this range. For example, a bias moving to −0.5−ε is then mapped to +0.5−ε. Then the bias oscillates back to +0.5+ε and is then mapped back to −0.5+ε. In practice, it has been found that with a range of [−1, +1[ bias jumps can be avoided for several months.
Note that MW bias jumps can also be handled at the rover by comparing the latest received MW bias value with the previous one. If the values differ by approximately one cycle a bias jump is detected and the correct bias reconstructed. The situation is complicated by the fact that WL ambiguities consistent with shifted satellite MW biases are used in the phase clock processor to determine iono-free (IF) biases that are also sent to the rover. Reconstructing the MW bias at the rover after a jump requires also an adaptation of the IF bias by 1⁄2(λWL−λNL).
FIG. 22C shows an alternative to the external satellite MW bias shifter module 2505 of FIG. 22A. Satellite MW biases 1430 and WL-ambiguities 1435 are sent to an internal shifter module 2580 that determines on the basis of equation (46) shifts for MW biases and WL ambiguities such that the biases are mapped to the desired range. Then all these shifts are applied to the bias and ambiguity states in the filter. In this way biases have to be shifted only once while in the approach of FIG. 22A the shifts are repeated each time satellite MW biases are output.
However, note that unshifted and shifted WL ambiguities are not allowed to be used at the same time in a single filter. This is e.g. important when WL ambiguities are forwarded to the orbit processor 330 for fixing IF ambiguities. If fixed IF ambiguities are reintroduced into a single original filter (and no filter copy as in FIG. 21C is used), WL ambiguities of different epochs come together in the filter. It has to be ensured that the WL ambiguities of different epochs are the same. If this is not the case the corresponding IF ambiguity is reset.
Part 7.11 MW Bias Process: Numerical Examples
The behavior of daily solutions for MW satellite biases was monitored over a time period of 61 days in June and July 2008 and the difference of each daily solution to the first day of this period (June 1). PRN 16 was chosen as the reference satellite with bias value 0. All biases were mapped into the interval [0,1]. Drifts of different sizes in the satellite biases are clearly detectable. All the larger drifts occur for block IIA satellites. Individual satellites show drifts of about 0.2 WL cycles within a month. These values would motivate a satellite bias update of perhaps once per day. However, for PRN 24 there is a sudden bias jump on June 26 of almost 0.2 WL cycles. The occurrence of such events demonstrates the importance of real-time estimation and transmission of MW satellite biases.
In another example the MW satellite biases for the time period from Oct. 2 to 14, 2008 were continuously processed in a Kalman filter. Again PRN 16 was chosen as the reference. The result shows that each satellite has its own daily pattern with some kind of repetition already after 12 hours (the time a GPS satellite needs for one revolution). The variations of the satellite biases are up to about 0.16 WL cycles within 6 hours. The difference of the MW satellite biases to the values they had 24 hours before demonstrates that the day to day repeatability is usually below 0.03 WL cycles. However, this day to day repeatability does not well reflect the large inner day variations of the MW satellite biases.
The filtered satellite WL biases are dependent on their process noise input. With a noise input variance between 10−6 and 10−7 squared WL cycles per hour the periodical behavior and the sudden bias level change on June 26 is well reflected. With less noise input these patterns are not detected. Due to this analysis a process noise input variance of 5·10−7 squared WL cycles per hour on satellite WL biases is recommended.
Part 7.12 MW Bias Process: References
References relating to the MW bias process include the following:

    Bierman, G. J. (1977). Factorization Methods for Discrete Sequential Estimation. New York: Academic Press, Inc.
    Collins, P. (2008). Isolating and Estimating Undifferenced GPS Integer Ambiguities. Proceedings of ION-NTM-2008, (pp. 720-732). San Diego, Calif.
    Collins, P., Gao, Y., Lahaye, F., Héroux, P., MacLeod, K., & Chen, K. (2005). Accessing and Processing Real-Time GPS Corrections for Precise Point Positioning—Some User Considerations. Proceedings of ION-GNSS-2005, (pp. 1483-1491). Long Beach, Calif.
    Collins, P., Lahaye, F., Héroux, P., & Bisnath, S. (2008). Precise Point Positioning with Ambiguity Resolution using the Decoupled Clock Model. Proceedings of ION-GNSS-2008. Savannah, Ga.
    Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Chapter 23: Minimum Spanning Trees. In Introduction to Algorithms (Second Edition ed., pp. 561-579). MIT Press and McGraw-Hill.
    Datta-Barua, S., Walter, T., Blanch, J., & Enge, P. (2007). Bounding Higher Order Ionosphere Errors for the Dual Frequency GPS User. Radio Sci., 43, RS5010, doi:10.1029/2007RS003772.
    Ge, M., Gendt, G., Rothacher, M., Shi, C., & Liu, J. (2008). Resolution of GPS carrier-phase ambiguities in Precise Point Positioning (PPP) with daily observations. Journal of Geodesy, Vol. 82, pp. 389-399.
    Grewal, M. S., & Andrews, A. P. (2001). Kalman Filtering: Theory and Practice Using MATLAB. New York: Wiley-Interscience.
    Héroux, P., & Kouba, J. (2001). GPS Precise Point Positioning Using IGS Orbit Products. Phys. Chem. Earth (A), Vol. 26 (No. 6-8), pp. 572-578.
    Laurichesse, D., & Mercier, F. (2007). Integer ambiguity resolution on undifferenced GPS phase measurements and its application to PPP. Proceedings of ION-GNSS-2007, (pp. 839-448). Fort Worth, Tex.
    Laurichesse, D., Mercier, F., Berthias, J., & Bijac, J. (2008). Real Time Zero-difference Ambiguities Fixing and Absolute RTK. Proceedings of ION-NTM-2008, (pp. 747-755). San Diego, Calif.
    Melbourne, W. (1985). The case for ranging in GPS-based geodetic systems. Proceedings of the First International Symposium on Precise Positioning with the Global Positioning System. Vol. 1, pp. 373-386. Rockville, Md.: US Dept. of Commerce.
    Mervart, L., Lukes, Z., Rocken, C., & Iwabuchi, T. (2008). Precise Point Positioning With Ambiguity Resolution In Real-Time. Proceedings of ION-GNSS-2008. Savannah, Ga.
    Morton, Y., van Graas, F., Zhou, Q., & Herdtner, J. (2008). Assessment of the Higher Order Ionosphere Error on Position Solutions. ION GNSS 21st International Meeting of the Satellite Division. Savannah, Ga., USA.
    Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1996). F-Distribution Probability Function. In Numerical Recipes in C (p. 229). Cambridge University Press.
    Schaer, S. (2000, May 9). IGSMAIL-2827: Monitoring (P1-C1) code biases. Retrieved from http://igscb.jpl.nasa.gov/mail/igsmail/2000/msg00166.html.
    Teunissen, P. (1995). The least-squares ambiguity decorrelation adjustment: a method for fast GPS integer ambiguity estimation. Journal of Geodesy, Vol. 70, No. 1-2, pp. 65-82.
    Wübbena, G. (1985). Software Developments for Geodetic Positioning with GPS using TI 4100 code and carrier measurements. Proceedings of the First International Symposium on Precise Positioning with the Global Positioning System. Vol. 1, pp. 403-412. Rockville, Md.: US Dept. of Commerce.
    Zumberge, J., Heflin, M., Jefferson, D., Watkins, M., & Webb, F. (1997). Precise point positioning for the efficient and robust analysis of GPS data from large networks. Journal of Geophysical Research, Vol. 102 (No. B3), pp. 5005-5018.

Part 8: Orbit Processor



Precise (cm-accurate) orbits allow precise satellite clock estimation and precise positioning. Orbit accuracy has a direct influence on the final position accuracy of the rover using precise satellite orbits and clocks data as described herein.
Part 8.1 Option 1: Use IGS-Published Ultra-Rapid Orbits
The International GNSS Service (IGS) provides predicted satellite orbits which can be downloaded via the Internet. A description of these orbits can be found in J. KOUBA, A GUIDE TO USING INTERNATIONAL GPS SERVICE (IGS) PRODUCTS, Geodetic Survey Division, Natural Resources Canada, February 2003, 31 pages and at http://igscb.jpl.nasa.gov/components/prods.html.
The IGS Ultra-rapid (predicted) orbits, also called IGU orbits, are generated and published four times a day at 3, 9, 15, 21 hours of the UTC day. IGS claims a 5 cm orbit standard deviation, though our analyses have shown that individual satellite orbit errors can go up to 60 cm. In one case we have seen a 2 meter error.
Market requirements for commercial positioning service demand precise orbits with errors less than 3 cm and with high reliability and availability. The currently available IGU orbits do not meet these requirements. Nevertheless, they are useful either for positioning applications where the requirements are less demanding, or as a countercheck to detect gross errors in orbits estimated as described below.
Part 8.2 Option 2: Determine Satellite Orbits in Real Time
Referring to FIG. 1, observation data is streamed in real time from globally distributed GNSS reference stations, such as reference stations 105, 110, 115, to network processor 140. In some embodiments, the network processor estimates the satellite orbits in real time using a Kalman-filter approach in a numerically stable UD-Filter implementation as described in G. Bierman, Factorization Methods for Discrete Sequential Estimation, Academic Press, Inc., New York, 1977. Hereafter the term real time refers to processing immediately after observation data is available, typically in less than one second. The time-dependent filter state x(t) is set up in the following way
xcr(t) receiver clock errors
xcs(t) satellite clock errors
xqs(t) satellite dependent orbit parameters
x(t)=xr (t) receiver positions
xZDT(t) zenith tropospheric delays for each station
xEOP(t) earth orientation parameters
(EOP: xp, yp, UT1-UTC or length of day)
xAMB carrier-phase ambiguities
xif-bias iono-free biases
where
xcr(t) is the vector with all receiver clock errors in the network. Each station has at least one clock offset but may have also drift and drift rates, depending on the type and stability of the station clock. The receiver clocks are modeled, for example, as white noise processes or as stochastic processes (e.g., random walk, Gauss Markov) depending on the type and stability of the station clock.
xcs(t) is the vector with the satellite clocks. The vector contains a clock offset and a drift but may have drift and drift rates depending on the type and stability of the satellite clock (Rubidium, Cesium or Hydrogen maser). The satellite clocks are modeled, for example, as white noise processes or as stochastic processes depending on the type and stability of the satellite clock.
xqs(t) is the vector with the satellite dependent dynamic orbit parameters. This includes the satellite positions and velocities and additional force model parameters, which are




  
    
      
        
          
            x
            qs
          
          ⁡
          
            (
            t
            )
          
        
        =
        
          [
          
            
              
                
                  
                    x
                    s
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
              
            
            
              
                
                  
                    
                      x
                      .
                    
                    s
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
              
            
            
              
                
                  
                    x
                    sir
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
              
            
            
              
                
                  
                    x
                    harm
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        47
        )
      
    
  




where
xs(t) is the satellite position vector (one per satellite) in the inertial reference frame (X,Y,Z).
{dot over (x)}s(t) is the satellite velocity vector (one per satellite) in the inertial reference frame (X,Y,Z).
xslr(t) is the vector with the solar radiation pressure parameters. It consists of a component in the sun-satellite direction, a second component in the direction of the solar radiation panel axis and a third component perpendicular on the first 2 axes. All three components are modeled for example as stochastic processes.
xharm(t) is the vector with harmonic coefficients for the orbit components along-track, radial and cross-track or in a satellite body fixed coordinate system. They are modeled for example as stochastic processes.
xr (t) is the station position vector in the Earth centered/Earth fixed reference frame. Stations can be either fixed or unknown in the estimation process.
xZTD(t) is the vector with the tropospheric zenith delays estimated for each station. Tropospheric gradients are optionally also estimated. These parameters are modeled for example as stochastic processes.
xEOP(t) are earth orientation parameters (EOPs) estimated routinely in real time. The vector consists of the offsets to the conventional pole (xp, yp) and the difference between UT1 and UTC time scales (UT1-UTC or length of day). The precisely-known EOP parameters are used to transition between the inertial and the earth-fixed reference frames. All three parameters are estimated for example as stochastic processes.
xAMB each satellite-station link has an individual carrier phase ambiguity in the filter state. These parameters are modeled for example as constants.
xif-bias ionospheric-free code-carrier biases, one bias per receiver-satellite pair. Code and carrier have biases, which are different from receiver to receiver and satellite to satellite and might vary with time These parameters are modeled for example via stochastic processes.
The ionospheric-free dual-frequency combinations of code and carrier observations have different biases, which vary with time. While these parameters can be estimated as additional unknowns in the orbit processor Kalman filter, they are optionally estimated in a separate processor (e.g. in standard clock processor 320 as ionospheric-free code-carrier biases 372, shown in FIG. 3) and applied to the pseudorange observations used in the orbit processor.
For linearization purposes, some embodiments have the filter set up to estimate differences to a reference trajectory and to initial force model parameters. In these embodiments the state vector for each satellite is




  
    
      
        
          
            x
            qs
          
          ⁡
          
            (
            
              t
              k
            
            )
          
        
        =
        
          
            [
            
              
                
                  
                    
                      r
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                    -
                    
                      
                        r
                        0
                      
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                  
                
              
              
                
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                    -
                    
                      
                        p
                        0
                      
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                  
                
              
              
                
                  
                    y
                    -
                    
                      y
                      0
                    
                  
                
              
            
            ]
          
          =
          
            [
            
              
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      r
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                  
                
              
              
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      p
                      ⁡
                      
                        (
                        
                          t
                          k
                        
                        )
                      
                    
                  
                
              
              
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    y
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        48
        )
      
    
  




where
xqs(tk) is the satellite state vector at time tk 
r(tk) is the satellite position and velocity in the inertial reference frame
r0(tk) represents the reference trajectory created by a numerical orbit integrator
p(tk) is the vector with stochastic force model parameters
p0(tk) is the vector with approximate initial stochastic force model parameters
y is the vector with constant force model parameters
y0 is the vector with approximate constant force model parameters
and where




  
    
      
        
          r
          ⁡
          
            (
            
              t
              k
            
            )
          
        
        =
        
          [
          
            
              
                
                  
                    x
                    x
                  
                  ⁡
                  
                    (
                    
                      t
                      k
                    
                    )
                  
                
              
            
            
              
                
                  
                    
                      x
                      .
                    
                    x
                  
                  ⁡
                  
                    (
                    
                      t
                      k
                    
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        49
        )
      
    
  




The prediction in the filter model for the satellite dependent part is done via the following relation




  
    
      
        
          [
          
            
              
                
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    r
                    ⁡
                    
                      (
                      
                        t
                        
                          k
                          +
                          1
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        t
                        
                          k
                          +
                          1
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  y
                
              
            
          
          ]
        
        =
        
           
          
            
              
                [
                
                  
                    
                      
                        
                          Φ
                          rr
                        
                        ⁡
                        
                          (
                          
                            
                              t
                              
                                k
                                +
                                1
                              
                            
                            ,
                            
                              t
                              k
                            
                          
                          )
                        
                      
                    
                    
                      
                        
                          Φ
                          rp
                        
                        ⁡
                        
                          (
                          
                            
                              t
                              
                                k
                                +
                                1
                              
                            
                            ,
                            
                              t
                              k
                            
                          
                          )
                        
                      
                    
                    
                      
                        
                          Φ
                          ry
                        
                        ⁡
                        
                          (
                          
                            
                              t
                              
                                k
                                +
                                1
                              
                            
                            ,
                            
                              t
                              k
                            
                          
                          )
                        
                      
                    
                  
                  
                    
                      0
                    
                    
                      
                        M
                        k
                      
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      0
                    
                    
                      1
                    
                  
                
                ]
              
              [
              
                
              
              ⁢
              
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            k
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        p
                        ⁡
                        
                          (
                          
                            t
                            k
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      y
                    
                  
                
              
              ]
            
            +
            
               
              
                [
                
                  
                    
                      0
                    
                  
                  
                    
                      
                        w
                        k
                      
                    
                  
                  
                    
                      0
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        50
        )
      
    
  




with





  
    
      
        
          
            
              Φ
              rr
            
            ⁡
            
              (
              
                
                  t
                  
                    k
                    +
                    1
                  
                
                ,
                
                  t
                  k
                
              
              )
            
          
          =
          
            [
            
              
                ∂
                
                  r
                  ⁡
                  
                    (
                    
                      t
                      
                        k
                        +
                        1
                      
                    
                    )
                  
                
              
              
                ∂
                
                  r
                  ⁡
                  
                    (
                    
                      t
                      k
                    
                    )
                  
                
              
            
            ]
          
        
        ,
        
          
            r
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              r
              0
            
            ⁡
            
              (
              t
              )
            
          
        
      
    
    
      
        (
        51
        )
      
    
  
  
    
      
        
          
            
              Φ
              rp
            
            ⁡
            
              (
              
                
                  t
                  
                    k
                    +
                    1
                  
                
                ,
                
                  t
                  k
                
              
              )
            
          
          =
          
            [
            
              
                ∂
                
                  r
                  ⁡
                  
                    (
                    
                      t
                      
                        k
                        +
                        1
                      
                    
                    )
                  
                
              
              
                ∂
                
                  p
                  ⁡
                  
                    (
                    
                      t
                      k
                    
                    )
                  
                
              
            
            ]
          
        
        ,
        
          
            r
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              r
              0
            
            ⁡
            
              (
              t
              )
            
          
        
        ,
        
          
            p
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              p
              0
            
            ⁡
            
              (
              t
              )
            
          
        
      
    
    
      
        (
        52
        )
      
    
  
  
    
      
        
          
            
              Φ
              ry
            
            ⁡
            
              (
              
                
                  t
                  
                    k
                    +
                    1
                  
                
                ,
                
                  t
                  k
                
              
              )
            
          
          =
          
            [
            
              
                ∂
                
                  r
                  ⁡
                  
                    (
                    
                      t
                      
                        k
                        +
                        1
                      
                    
                    )
                  
                
              
              
                ∂
                y
              
            
            ]
          
        
        ,
        
          
            r
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              r
              0
            
            ⁡
            
              (
              t
              )
            
          
        
        ,
        
          y
          =
          
            y
            0
          
        
      
    
    
      
        (
        53
        )
      
    
  




These matrices are computed for example by integration of the variational equations as described in the section below on numerical orbit integration.
Mk is the matrix describing the stochastic noise modeling
wk is the noise input
Part 8.3 Numerical Orbit Integration
The satellite motion in orbit can be described by a second order differential equation system

{umlaut over (x)}={umlaut over (x)}(x,{dot over (x)},q)  (54)

with
{umlaut over (x)} acceleration in the inertial reference frame
x position in the inertial reference frame
{dot over (x)} velocity in the inertial reference frame
q vector of satellite dependent force model unknowns and initial position/velocity
The vector q is defined as




  
    
      
        q
        =
        
          [
          
            
              
                
                  r
                  ⁡
                  
                    (
                    
                      t
                      0
                    
                    )
                  
                
              
            
            
              
                a
              
            
          
          ]
        
      
    
    
      
        (
        55
        )
      
    
  




where
r(t0) are the initial position and velocity in inertial reference frame
a is the vector with dynamic force model parameters
Satellite position x(t) and velocity {dot over (x)}(t) at time t are derived from satellite position x(t0) and velocity {dot over (x)}(t0) at time t0 using, for example, a numerical integration (a predictor-corrector method of higher order).

{dot over (x)}(t)={dot over (x)}(t0)+∫{umlaut over (x)}(t)dt  (56)

x(t)=x(t0)+∫{dot over (x)}(t)dt  (57)

The real-time filter uses the partial derivatives of the accelerations {umlaut over (x)}(t) with respect to the unknown parameters q




  
    
      
        
          [
          
            
              ∂
              
                x
                 ̈
              
            
            
              ∂
              q
            
          
          ]
        
        =
        
          
            [
            
              
                ∂
                
                  x
                   ̈
                
              
              
                ∂
                x
              
            
            ]
          
          ⁡
          
            [
            
              
                ∂
                x
              
              
                ∂
                q
              
            
            ]
          
        
      
    
    
      
        (
        58
        )
      
    
  




The equation of this example ignores derivatives with respect to satellite velocity since there are no relevant velocity-dependent forces acting on GNSS satellites in medium earth orbit.
The following matrix is computed for epoch t1:




  
    
      
        
          
            Φ
            rq
          
          ⁡
          
            (
            
              
                t
                i
              
              ,
              
                t
                0
              
            
            )
          
        
        =
        
          [
          
            
              
                
                  
                    ∂
                    x
                  
                  
                    ∂
                    
                      q
                      ⁡
                      
                        (
                        
                          
                            t
                            i
                          
                          ,
                          
                            t
                            0
                          
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  
                    ∂
                    
                      x
                      .
                    
                  
                  
                    ∂
                    
                      q
                      ⁡
                      
                        (
                        
                          
                            t
                            i
                          
                          ,
                          
                            t
                            0
                          
                        
                        )
                      
                    
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        59
        )
      
    
  




The matrix for the next epoch ti+1 can then be computed via the chain rule

Φrq(ti+1,t0)=Φrq(ti+1,ti)Φrq(ti,t0)  (60)

The partial derivatives of the observations with respect to the unknowns q can again be derived via chain rule




  
    
      
        
          
            ∂
            l
          
          
            ∂
            q
          
        
        =
        
          
            
              ∂
              l
            
            
              ∂
              r
            
          
          ⁢
          
            Φ
            rq
          
        
      
    
    
      
        (
        61
        )
      
    
  




These partials are used in the observation update of the filter.

The following models are used to compute the accelerations z acting on the satellite; some embodiments use these for the integration process:
1. The Earth's gravity field is modeled by available models such as the EIGEN-CG01C or the EGM96 model. These are spherical harmonic expansions with very high resolution. Some embodiments use up to degree and order 12 for orbit integration.
2. Gravitational forces due to the attraction by sun, moon and planets.
3. The gravitational forces of sun and moon acting on the Earth's figure will deform the Earth. This effect also changes the gravity field; it is called “Solid Earth Tide” effect. Some embodiments follow the recommendations of the IERS Conventions 2003.
4. Some embodiments account for the Solid Earth Pole Tide, caused by the centrifugal effect of polar motion. This tide must not be confused with Solid Earth Tides. Some embodiments follow the recommendations of the IERS Conventions 2003.
5. The gravitational forces of sun and moon acting on the oceans will change the gravity field; this is called the “Ocean Tide” effect. Some embodiments use the CSR3.0 model recommended by the IERS Conventions 2003.
6. Some embodiments also consider the relativistic acceleration, which depends upon position and velocity of the satellite.
7. The solar radiation pressure, the acceleration acting on GNSS satellites, is most difficult to model. Some embodiments consider three components: a first component in the sun-satellite direction, a second component in the direction of the solar radiation panel axis (y-bias) and a third component perpendicular to the first two axes.
8. Some embodiments also model residual errors mainly induced by the insufficient knowledge of the force models via harmonic functions as described in the following.
GNSS satellites like GPS, GLONASS, GALILEO and COMPASS satellites are in mid earth orbits (MEO) of approximately 26000 km. The following table shows the accelerations acting on GNSS satellites and their effects after a one-day orbit integration.














Orbit prediction



Acceleration
error after


Perturbation
[m/s2]
one day [m]

















Earth's gravitation
0.59
330000000


Earth's oblateness
5 · 10−5
24000


Lunar direct tides
5 · 10−6
2000


Solar direct tides
2 · 10−6
900


Higher degree terms in geopotential
3 · 10−7
300


Direct solar radiation pressure
9 · 10−8
100


Radiation pressure along solar panel
5 · 10−10
6


axis


Earth albedo (solar radiation due to
3 · 10−9
2


reflection by earth)


Solid Earth tides
1 · 10−9
0.3


Ocean tides
1 · 10−10
0.06


General relativity
3 · 10−10
0.3


Venus in lower conjunction
2 · 10−10
0.08









Part 8.4 Harmonic Force Modeling
Some embodiments handle residual errors by introducing a harmonic model having a cosine term and a sine term in each of the along-track, radial and cross-track directions. As the residuals have a period of about one revolution of the satellite about the Earth, the harmonics depend on the argument of latitude of the satellite:




  
    
      
        
          
            
              x
              →
            
             ̈
          
          residual
        
        =
        
          
            (
            
              
                
                  
                    
                      
                        A
                        1
                      
                      ⁢
                      cos
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                    +
                    
                      
                        A
                        2
                      
                      ⁢
                      sin
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                  
                
              
              
                
                  
                    
                      
                        A
                        3
                      
                      ⁢
                      cos
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                    +
                    
                      
                        A
                        4
                      
                      ⁢
                      sin
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                  
                
              
              
                
                  
                    
                      
                        A
                        5
                      
                      ⁢
                      cos
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                    +
                    
                      
                        A
                        6
                      
                      ⁢
                      sin
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                  
                
              
            
            )
          
          =
          
            
              (
              
                
                  
                    
                      A
                      1
                    
                  
                  
                    
                      A
                      2
                    
                  
                
                
                  
                    
                      A
                      3
                    
                  
                  
                    
                      A
                      4
                    
                  
                
                
                  
                    
                      A
                      5
                    
                  
                  
                    
                      A
                      6
                    
                  
                
              
              )
            
            ⁢
            
              (
              
                
                  
                    
                      cos
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                  
                
                
                  
                    
                      sin
                      ⁢
                      
                        
                      
                      ⁢
                      u
                    
                  
                
              
              )
            
          
        
      
    
    
      
        (
        62
        )
      
    
  




with
A1, A2 . . . amplitudes to be estimated for along-track
A3, A4 . . . amplitudes to be estimated for cross-track
A5, A6 . . . amplitudes to be estimated for radial component
u . . . argument of latitude of the satellite
Alternatively to the use of along track, cross track and radial components, the satellite related system (sun-satellite direction, solar panel direction and the normal to both) can be used, to model solar radiation pressure.
Part 8.5 Transformation from Inertial to Earth-Fixed Reference Frame
Some embodiments transform from Inertial to the Earth-fixed reference frame using the IAU 2000A precession/nutation formulas, which follow the IERS Conventions 2003.
Part 8.6 Earth Orientation Parameters
Some embodiments take Earth orientation parameters (EOPs) from the IERS rapid files GPSRAPID.DAILY. These files are provided by IERS on a daily basis and are based on the combination of the most recently available observed and modeled data (including VLBI 24-hour and intensive, GPS, and AAM (Atmospheric Angular Momentum)). The combination process involves applying systematic corrections and slightly smoothing to remove the high frequency noise. GPSRAPID.DAILY contains the values for the last 90 days from Bulletin A for x/y pole, UT1-UTC, dPsi, dEps, and their errors and predictions for next 15 days at daily intervals.
After the interpolation, UT1 is corrected for diurnal and/or semidiurnal variations due to Ocean Tides. The polar motion angles are corrected for diurnal variations due to tidal gravitation for a non-rigid Earth, as well as for diurnal and/or semidiurnal variations due to Ocean Tides. Corrections are computed according to:




  
    
      
        
          
            Δ
            ⁢
            
              
            
            ⁢
            A
          
          =
          
            
              
                ∑
                j
              
              ⁢
              
                
                  B
                  Af
                
                ⁢
                sin
                ⁢
                
                  
                
                ⁢
                
                  θ
                  f
                
              
            
            +
            
              
                C
                Af
              
              ⁢
              cos
              ⁢
              
                
              
              ⁢
              
                θ
                f
              
            
          
        
        ,
        
          A
          ∈
          
            {
            
              
                UT
                ⁢
                
                  
                
                ⁢
                1
              
              ,
              
                x
                P
              
              ,
              
                y
                P
              
            
            }
          
        
      
    
    
      
        (
        63
        )
      
    
  




Amplitudes BAf, CAf for 41 diurnal and 30 semi-diurnal Ocean Tidal constituents are listed in tables 8.2 and 8.3 in the IERS Conventions (2003). The EOPs from the GPSRAPID.DAILY are introduced as approximate values for the real-time estimation process, keeping linearization errors at a minimum.
Part 8.7 Startup of the Real-Time System
When starting the system for the first time or after interruptions of more than a day, some embodiments derive initial values for satellite position velocity and force model parameters using satellite broadcast ephemerides or IGU orbits. Some embodiments use a least-squares fit to adapt a numerically integrated orbit to the broadcast elements from the satellite navigation message or to the IGU orbit for the satellite. The adapted orbit initial state is then integrated for a time period of up to two days into the future. The satellite positions, velocities and partials are stored in a “partials” file for use by the real-time system.
FIG. 23A shows an embodiment of the startup process 2600 for the real-time orbit processor. An orbit integrator 2605 predicts the orbital states (position and velocity) of each satellite into the future starting from an approximate orbit vector 2615, an initial state taken for example from the broadcast satellite ephemeris or the IGS ultra-rapid orbit IGU by using numerical integration and modeling all relevant forces acting on the satellites, e.g., predicted Earth orientation parameters from IERS. During this process an orbit prediction 2620 is generated, which holds all predicted orbital states and the partial derivatives. In a next step an adaptation process fits the predicted orbit to the broadcast orbit or IGU orbit via a least squares batch process. This process is iterated until the initial orbital states for the satellites are no longer changing. Then the partials file 2620 is forwarded to the real-time real-time orbit process 2630 of FIG. 26B.
FIG. 23B shows an embodiment of a real-time orbit process 2630. Process 2630 obtains values for an initial start vector 2635 from partials file 2635; these values are used to construct predicted observations for an iterative filter 2640 on a regular basis, e.g., every 150 seconds. Iterative filter 2640 is, for example, a classical Kalman filter or a UD factorized filter or a Square Root Information Filter (SRIF} The orbit start vector 2635 contains the partial derivatives of the current orbit state and force model parameters with respect to the start vector and EOPs and are used to map the partials of the observations to the start vector and force model unknowns. Kalman filter 2640 receives iono-free linear combinations 2645 of observation data from the reference stations in real time, e.g., each epoch, such as once per second, and predicted Earth orientation parameters (EOP) 2610. With each observation update, Kalman filter 2640 provides improved values for the state vector parameters: receiver clocks 2655 (one per station), zenith tropospheric delays 2660 (one per station), satellite clocks 2665 (one per satellite), optional satellite clock rates 2670 (one per satellite), and orbit start vectors 2680 (one orbit start vector per satellite). In the embodiment of FIG. 23B, orbit state vector 2680 is supplied from time to time (e.g., each epoch, such as once per second) and mapped via the orbit mapper 2682 to the current-epoch orbit position/velocity vector 350.
Orbit mapper 2682 uses the partial derivatives from the partials file and the following relationship to derive satellite position and velocity at the current epoch t, from the state vector at epoch t0 (FIG. 23C).




  
    
      
        
          r
          ⁡
          
            (
            
              t
              i
            
            )
          
        
        =
        
          
            
              
                r
                0
              
              ⁡
              
                (
                
                  t
                  i
                
                )
              
            
            +
            
              
                
                  Φ
                  rq
                
                ⁡
                
                  (
                  
                    
                      t
                      i
                    
                    ,
                    
                      t
                      0
                    
                  
                  )
                
              
              ⁢
              
                
                  x
                  qs
                
                ⁡
                
                  (
                  
                    t
                    0
                  
                  )
                
              
            
          
          =
          
            
              
                r
                0
              
              ⁡
              
                (
                
                  t
                  i
                
                )
              
            
            +
            
              
                [
                
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      
                        p
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      y
                    
                  
                
                ]
              
              [
              
                
              
              ⁢
              
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        p
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      y
                    
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        64
        )
      
    
  




with
r0 (ti) . . . reference trajectory (position and velocity) created by a numerical orbit integrator
Φrq(ti, t0) . . . partials of the position and velocity at ti with respect to the start vector
xqs (t0) . . . at ti estimated difference of the start vector (state vector) at t0 
Next r(ti) which is given in the inertial reference frame is transformed into the Earth centered/Earth fixed reference frame.
The current-epoch orbit position/velocity vector 350 in the Earth centered/Earth fixed reference frame is forwarded to the standard clock processor 320, to the phase clock processor 335 and to the scheduler 355 of FIG. 3.
Some embodiments of process 2630 avoid linearization errors by restarting the numerical integration in an orbit integrator 2685 from time to time, such as every 6 or 12 or 24 hours. Orbit mapper 2684 uses the partial derivatives from the partials file and the following relationship to derive a new orbit state vector 2690 in the inertial reference frame at time t0+x hours from the start vector at epoch t0 (FIG. 23D).




  
    
      
        
          r
          ⁡
          
            (
            
              t
              i
            
            )
          
        
        =
        
          
            
              
                r
                0
              
              ⁡
              
                (
                
                  t
                  i
                
                )
              
            
            +
            
              
                
                  Φ
                  rq
                
                ⁡
                
                  (
                  
                    
                      t
                      i
                    
                    ,
                    
                      t
                      0
                    
                  
                  )
                
              
              ⁢
              
                
                  x
                  qs
                
                ⁡
                
                  (
                  
                    t
                    0
                  
                  )
                
              
            
          
          =
          
            
              
                r
                0
              
              ⁡
              
                (
                
                  t
                  i
                
                )
              
            
            +
            
              
                [
                
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      
                        p
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                      ∂
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            i
                          
                          )
                        
                      
                    
                    
                      ∂
                      y
                    
                  
                
                ]
              
              [
              
                
              
              ⁢
              
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        r
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        p
                        ⁡
                        
                          (
                          
                            t
                            0
                          
                          )
                        
                      
                    
                  
                
                
                  
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      y
                    
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        65
        )
      
    
  




with
r0(ti) . . . reference trajectory (position and velocity) created by a numerical orbit integrator
Φrq(ti,t0) . . . partials of the position and velocity at t, with respect to the start vector
xqs (t0)) . . . at ti estimated difference of the start vector (state vector) at t0 
Predicted EOPs 2610 (e.g., from IERS) and estimated EOPs together with updated new orbit start vector 2690 are used as inputs to orbit integrator 2685 to transform coordinates between the inertial frame and the earth-fixed frame, e.g., following the IERS Conventions.
This numerical integration runs in the background and generates a new partials file 2635 which is used to update the predicted observations of Kalman filter 2640. The start vector for the numerical integration of orbit integrator 2675 is for example the latest best estimate of the real-time system, orbit start vector 2690.
Part 8.8 Fixing Ambiguities in Real-Time Orbit Determination
Kalman filter 2640 uses the ionospheric-free dual-frequency combinations 2645 of the L1 and the L2 GNSS observations. The ionospheric-free combination usually leads to a very small wavelength




  
    
      
        
          
            λ
            IF
          
          ⁢
          
            N
            IF
          
        
        :=
        
          
            
              
                
                  f
                  1
                  2
                
                ⁢
                
                  λ
                  1
                
                ⁢
                
                  N
                  1
                
              
              -
              
                
                  f
                  2
                  2
                
                ⁢
                
                  λ
                  2
                
                ⁢
                
                  N
                  2
                
              
            
            
              
                f
                1
                2
              
              -
              
                f
                2
                2
              
            
          
          =
          
            
              λ
              1
            
            ⁢
            
              
                
                  F
                  1
                
                
                  
                    F
                    1
                    2
                  
                  -
                  
                    F
                    2
                    2
                  
                
              
              
                }
                
                  =
                  
                    :
                    
                      λ
                      IF
                    
                  
                
              
            
            ⁢
            
              
                
                  (
                  
                    
                      
                        F
                        1
                      
                      ⁢
                      
                        N
                        1
                      
                    
                    -
                    
                      
                        F
                        2
                      
                      ⁢
                      
                        N
                        2
                      
                    
                  
                  )
                
                ⁢
                
                  
                
              
              
                }
                
                  :=
                  
                    N
                    IF
                  
                
              
            
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            
              
                
                  
                    
                      f
                      1
                    
                    =
                    
                      :
                      
                        
                          F
                          1
                        
                        ⁢
                        
                          
                        
                        ⁢
                        gcd
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            
                              f
                              1
                            
                            ,
                            
                              f
                              2
                            
                          
                          )
                        
                      
                    
                  
                
              
              
                
                  
                    
                      f
                      2
                    
                    =
                    
                      :
                      
                        
                          F
                          s
                        
                        ⁢
                        
                          
                        
                        ⁢
                        gcd
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            
                              f
                              1
                            
                            ,
                            
                              f
                              2
                            
                          
                          )
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        66
        )
      
    
  




The factors F1 and F2 are given in Table 3. For example, for GPS L1 and L2 frequencies with F1=77, F2=60 and λ1=0.1903 m the resulting iono-free wavelength is




  
    λ
    IF
  
  =
  
    
      
        λ
        1
      
      ⁢
      
        
          F
          1
        
        
          
            F
            1
            2
          
          -
          
            F
            2
            2
          
        
      
    
    ≈
    
      6
      ⁢
      
        
      
      ⁢
      
        mm
        .
      
    
  




This is below the noise level of the phase observations so that there is no possibility to directly fix the iono-free ambiguity to the correct integer value. Notice that for the iono-free combination between L2 and L5 the iono-free wavelength is with λIF≈12.47 cm large enough for reliable ambiguity resolution.

To make use of the integer nature of the L1 and L2 ambiguities one could try to solve for the L1 and L2 ambiguities, which is difficult due to the unknown ionospheric contribution to the L1 and L2 carrier phase observations at the stations. A preferred approach is to solve for carrier-phase ambiguities by fixing the widelane ambiguities NWL:=N1−N2 in a first step. Substituting N2 in (64) by N2=N1−NWL results in

λIFNIF=λNLN1+1⁄2(λWL−λNL)NWL  (67)

with





  
    λ
    WL
  
  :=
  
    
      
        c
        
          
            f
            1
          
          -
          
            f
            2
          
        
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        λ
        NL
      
    
    :=
    
      
        c
        
          
            f
            1
          
          +
          
            f
            2
          
        
      
      .
    
  




Thus, once NWL is known, (65) can be solved for N1 by using the float value from the filter for λIFNIF. After fixing the N1 ambiguity vector to integer or to a weighted average of integer values it can be reinserted into (65) to get a fixed value for λIFNIF.

In some embodiments the widelane ambiguities NWL are computed in the widelane bias processor 325 and are transferred to the orbit processor 2630 for example every epoch. For embodiments in which the orbit processor 2630 processes ionospheric-free observations, the ambiguities estimated are ionospheric-free ambiguities λIFNIF.
For embodiments in which the widelane ambiguities NWL are provided by the MW bias processor 325, equation (65) can also be used to reformulate the Kalman filter equations (by subtracting 1⁄2(λWL−λNL)NWL from the observations) and estimate the N1 ambiguities directly.
As an alternative to resolving the N1 ambiguity with a given integer widelane ambiguity, the equations above can be formulated such that N2 or narrowlane ambiguities are estimated instead; the approaches are equivalent because all these ambiguities are linearly related.
Some embodiments of ambiguity “fixing” mechanism 2695 employ any suitable techniques known in the art, such as Simple rounding, Bootstrapping, Integer Least Squares based on the Lambda Method, or Best Integer Equivariant (Verhagen, 2005, Teunissen and Verhagen, 2007).
The term “fixing” as used here is intended to include not only fixing of ambiguities to integer values using techniques such as rounding, bootstrapping and Lambda search, but also to include forming a weighted average of integer candidates to preserve the integer nature of the ambiguities if not fixing them to integer values. The weighted average approach is described in detail in international patent applications PCT/US2009/004476, PCT/US2009/004472, PCT/US2009/004474, PCT/US2009/004473, and PCT/US2009/004471 which are incorporated herein by this reference.
Analyses have shown that the orbit quality is significantly improved by “fixing” the ambiguities, either as integer values or as weighted averages of integer candidates.
Part 8.9 Orbit Processing at IGS Analysis Centers
GNSS orbit determination is done by a variety of IGS Analysis Centers. To our knowledge none of these Centers provides real-time orbit estimation as proposed here.
The CODE Analysis Center (AC) uses a batch least squares approach as described in Dach et al. (2007) and not a sequential filter implementation as described here. Details on the modeling are also described in Beutler et al. (1994). The CODE AC participates in the generation of the IGS Ultra-rapid orbits (IGU). Orbit positions correspond to the estimates for the last 24 hours of a 3-day long-arc analysis plus predictions for the following 24 hours. This is done every 6 hours while the processing and prediction time span is shifted by 6 hours in each step.
The Geoforschungszentrum GFZ estimates orbits and computes a contribution to the IGS Ultra-rapid orbits. The approach is documented by Ge et al. (2005, 2006). Their processing and that of the CODE process is based on a batch least squares approach. GFZ does ambiguity resolution, but only in post-processing mode. No attempt is documented on real-time efforts involving a sequential filter.
The European Space Operation Centre ESOC of ESA also contributes to the IGS Ultra-rapid orbit computation. The approach is documented by Romero et al. (2001) and Dow et al. (1999). The approach is also based only on a prediction of satellite orbits. No true real-time processing is done.
The Jet Propulsion Laboratory JPL, USA, determines GPS satellite orbits with their system based on the GIPSY-OASIS II software package developed for the US Global Positioning System, general satellite tracking, orbit determination and trajectory studies. Details are published in U.S. Pat. No. 5,963,167 of Lichten et al. The JPL system allows a fully automatic operation and delivery of validated daily solutions for orbits, clocks, station locations and other information with no human intervention. This data contributes to the orbits published by the IGS including the Ultra-rapid orbit service providing IGU orbits. U.S. Pat. No. 5,828,336 of Yunck et al. describes the implementation of a real-time sequential filter.
The approach of embodiments of the present invention differs from that of U.S. Pat. No. 5,828,336 in at least these ways: (1) the approach described in U.S. Pat. No. 5,828,336 appears to use smoothed pseudo-ranges only; an example observation update rate given is 5 minutes, (2) the JPL system described in U.S. Pat. No. 5,828,336 does not appear to fix carrier-phase ambiguities, and (3) the approach of U.S. Pat. No. 5,828,336 uses an ionospheric model.
Part 8.10 References
Some references related to orbit processing include the following:

    Beutler, G., E. Brockmann, W. Gurtner, U. Hugentobler, L. Mervart, and M. Rothacher (1994), Extended Orbit Modeling Techniques at the CODE Processing Center of the International GPS Service for Geodynamics (IGS): Theory and Initial Results, Manuscripta Geodaetica, 19, 367-386, April 1994.
    Bierman, Gerald J. (1977): Factorization Methods for Discrete Sequential Estimation, Academic Press, Inc., New York
    Dach, R., U. Hugentobler, P. Fridez, M. Meindl (eds.) (2007), Documentation of the Bernese GPS Software Version 5.0, January 2007
    Dow, J., Martin-Mur, T. J., ESA/ESOC Processing Strategy Summary, IGS Central Bureau web site, igscb.jpl.nasa.gov/igscb/center/analysis/esa.acn, 1999
    Ge, M., G. Gendt, G. Dick and F. P. Zhang (2005), Improving carrier-phase ambiguity resolution in global GPS, Journal of Geodesy, Volume 80, Number 4, July 2006, DOI: 10.1007/s00190-005-0447-0
    Ge, M., G. Gendt, G. Dick, F. P. Zhang and M. Rothacher (2006), A new data processing strategy for huge GNSS global networks, Journal of Geodesy, Volume 79, number 1-3, June 2005, DOI: 10.1007/s00190-006-0044-x
    Landau, Herbert (1988): Zur Nutzung des Global Positioning Systems in Geodäsie und Geodynamik Modellbildung, Software-Entwicklung und Analyse, Heft 36 der Schriftenreihe des Studiengangs Vermessungswesen der Universität der Bundeswehr München, Dezember 1988
    Lichten, S., Yoaz Bar-Sever, Winy Bertiger, Michael Heflin, Kenneth Hurst, Ronald J. Muellerschoen, Sien-Chong Wu, Thomas Yunck, James Zumberge (1995) GIPSY-OASIS II: A HIGH PRECISION GPS DATA PROCESSING SYSTEM AND GENERAL SATELLITE ORBIT ANALYSIS TOOL, Proceedings of NASA Technology Transfer Conference, Oct. 24-26, 1995, Chicago, Ill.


Lichten, Stephen M., Wu Sien-Chong, Hurst Kenneth, Blewitt Geoff, Yunck Thomas, Bar-Sever Yoaz, Zumberge James, Bertiger William I., Muellerschoen Ronald J., Thornton Catherine, Heflin Michael (1999), Analyzing system for global positioning system and general satellite tracking, U.S. Pat. No. 5,963,167, Oct. 5, 1999.

    McCarthy, Dennis D. and Gérard Petit (2003), IERS CONVENTIONS, IERS (International Earth Rotation Service) Technical Note 32, October 2003
    Romero, I., C. Garcia Martinez, J. M. Dow, R. Zandbergen (2001), Moving GPS Precise Orbit Determination Towards Real-Time, Proceedings GNSS 2001, Seville, Spain, May 2001.
    Yunck, Thomas P., William I. Bertiger, Stephen M. Lichten, Anthony J. Mannucci, Ronald J. Muellerschoen, Sien-Chong Wu, (1998), Robust real-time wide-area differential GPS navigation, U.S. Pat. No. 5,828,336, Oct. 27, 1998.
    Teunissen, P. J. G, S. Verhagen (2009); GNSS Carrier Phase Ambiguity Resolution: Challenges and Open Problems, In M. G. Sideris (ed.); Observing our Changing Earth, International Association of Geodesy Symposia 133, Spinger Verlag Berlin-Heidelberg 2009.
    Verhagen, Sandra (2995): The GNSS integer ambiguities: estimation and validation, Publications on Geodesy 58, Delft, 2005. 194 pages., ISBN-13: 978 90 6132 290 0. ISBN-10: 90 6132 290 1.

Part 9: Phase-Leveled Clock Processor



Referring to FIG. 3, the phase clock processor 335 receives as input MW biases bMWj 345 (one per satellite) and/or widelane ambiguities Ni,WLj 340 (one per satellite-receiver pair), precise orbit information 350 (one current orbit position/velocity per satellite), troposphere information 370 (one troposphere zenith delay per station), low-rate code leveled clocks 365 (one low-rate code-leveled clock error per satellite) and the reference-station GNSS observation data 305 or 315. The phase clock processor 335 generates from these inputs the computed high-rate code-leveled clocks 375 (one high-rate code-leveled clock error per satellite) and the high-rate phase-leveled clocks 370 (one high-rate phase-leveled clock error per satellite), and forwards the MW biases 345 (one per satellite).
Part 9.1 Determining WL Ambiguities from MW Biases
Neglecting multipath, a useful characteristic of the Melbourne-Wübbena (MW) linear combination Φi,WLj−Pi,NLj is that, aside from some remaining noise εi,MWj, only the satellite MW biases bMWj and the receiver MW biases bi,MW and the widelane ambiguity term λWLNi,WLj remain:

Φi,WLj−Pi,NLj=bi,MW−bMWj+λWLNi,WLj+εi,MWj  (68)

To get rid of the noise εi,MWj, the Melbourne-Wübbena linear combination for each satellite is in some embodiments reduced by the satellite MW bias bMWj for that satellite and smoothed (e.g., averaged) over time. Single-differencing between satellites then cancels out the receiver MW bias bi,MW, leaving only a single-differenced widelane ambiguity term per satellite-receiver-satellite connection. The single-differenced widelane ambiguities are computed using the (constant) widelane wavelength λWL. Since only single-differenced widelane ambiguities are used in the phase clock processor, this method is in some embodiments used as a substitute for using the widelane ambiguities 340 from the MW bias processor 325 and/or for a quality check on the widelane ambiguities 340 received from the MW bias processor 325.
Part 9.2 Single-Differenced Phase-Leveled Clocks
The location of each reference station is precisely known. The precise location of each satellite at each epoch is given by the current orbit position/velocity data 350 from orbit processor 330. The geometric range ρij between a satellite j and a reference station i at each epoch is calculated from their known locations. The tropospheric delay Tij for each reference station is received from the code clock processor 320.
The ionospheric-free linear combination

Φi,IFj=ρij+cΔtΦ,i−cΔtΦj+Tij+λIFNi,IFj+εΦ,i,IFj  (69)

is reduced by the (known) geometric range ρij and the (known) troposphere delay Tij, leaving as unknowns only the ionospheric-free ambiguity term λIFNi,IFj=λNLNi,1j+1⁄2(λWL−λNL)Ni,WLj, the satellite phase clock error term cΔtΦj=cΔt+bΦ,IFj and the receiver phase clock error term cΔtΦ,i:=cΔt+bΦ,i,IF.

Single-differencing the observations of two satellites at the same receiver cancels out the receiver clock error.
Reducing this single difference by the according single difference widelane ambiguity leads to the single difference phase clock together with a single difference N1 ambiguity (often also called narrowlane ambiguity in this context since its corresponding wavelength here is λNL).

Φi,IFj1j2−ρij1j2−Tij1j2−1⁄2(λWL−λNL)Ni,WLj1j2=−cΔtΦj1j2+λNLNi1j1j2+εΦ,i,IFj1j2  (70)

This is computed for each station observing the same pair of satellites. At this point it is impossible to distinguish between the single difference satellite clock error and the single difference narrowlane ambiguity term, which is an integer multiple of the narrowlane wavelength.
If the single difference ambiguity is set to zero a single difference phase clock

cΔ{tilde over (t)}Φ,ij1j2:=−(Φi,IFj1j2−ρij1j2−Tij1j2−1⁄2(λWL−λNL)Ni,WLj1j2)  (71)

shifted by an integer number of narrowlane cycles is achieved. This phase clock has a non fixed narrowlane status. The difference of two of those single difference clocks cΔ{tilde over (t)}Φ,i1j1j2 and cΔ{tilde over (t)}Φ,i2j1j2 is an integer number of narrowlane cycles.

Part 9.3 Smoothed Single-Differenced Phase Clocks
For each pair of satellites, the single-differenced phase clock errors observed from different stations shifted to a common level using fixed narrowlane ambiguities is averaged to get a more precise clock error:




  
    
      
        
          c
          ⁢
          
            
          
          ⁢
          Δ
          ⁢
          
            
          
          ⁢
          
            
              t
              _
            
            Φ
            
              
                j
                1
              
              ⁢
              
                j
                2
              
            
          
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                (
                
                  
                    c
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        t
                        ~
                      
                      
                        Φ
                        ,
                        i
                      
                      
                        
                          j
                          1
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                  +
                  
                    
                      λ
                      NL
                    
                    ⁢
                    
                      N
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                      
                        
                          j
                          1
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                
                )
              
              .
            
          
        
      
    
    
      
        (
        72
        )
      
    
  




Part 9.4 Phase-Leveled Clock Estimation
Part 9.4.1 Spanning-Tree-Based Phase Clocks
Some embodiments use a spanning-tree approach to estimate phase-leveled clocks. To compute a single-differenced clock error between any arbitrary pair of satellites, a set of single difference-phase clocks is needed for the satellite-to-satellite links such that there is a unique path to reach each satellite via satellite-to-satellite links starting from a dedicated reference satellite. If all satellites are nodes of a graph, such a path is called spanning tree. If each edge of the graph is equipped with a weight, a minimum spanning tree is a spanning tree with a minimal sum of edge weights. Some embodiments use a discrete category based weighting scheme for an edge between two satellites and assign the following phase clock values to the edge:
i. Several edges connecting satellites j1 and j2 have a fixed N1 ambiguity: (Weighted) averaged single-differenced clock c ΔtΦj1j2,
ii. Only a single edge connecting satellites j1 and j2 has a fixed N1 ambiguity: cΔ{tilde over (t)}Φ,ij1j2+λNLNi1j1j2,
iii. No edge connecting satellites j1 and j2 has a fixed N1 ambiguity: cΔ{tilde over (t)}Φ,ij1j2 for receiver i with min(elevation(j1,j2) is maximal,
iv. No WL ambiguity available for edge connecting satellites j1 and j2: Don't use such an edge; thus no phase clock has to be defined;
Each edge of category (i) has a lower weight than an edge of category (ii), each edge of category (ii) has a lower weight than an edge of category (iii) etc. Edges within each category have a continuous weight that is in some embodiments derived in category (i) from the variance of the average and in category (ii) and (iii) from the elevations under which the satellites in the single difference are seen at the corresponding station.
If the minimum spanning tree uses an edge without a fixed narrowlane status, the narrowlane ambiguity Ni1j1j2 is set to zero and achieves fixed status. Choosing a reference satellite with phase clock error cΔtΦjref set to zero, single-differenced phase clock errors cΔtΦjref1j2 to all other satellites are computed solving a linear system. The satellite's phase clock error is then defined as cΔtΦj2:=cΔtΦjrefj2 
Part 9.4.2 Filter Estimation of Phase-Leveled Clocks
Some embodiments use a filter approach to estimate phase-leveled clocks. A filter is set up with all satellite phase clock errors as states. The state of the reference satellite's clock error cΔtΦjref is set to zero. In some embodiments all links from the spanning tree and in addition all links with fixed narrowlanes are added to the filter to estimate more precise single-differenced phase clock errors.
Part 9.5 Narrowlane Filter Bank
Once a set of single-differenced phase clock errors is estimated, e.g., as in Part 9.4, all observations for shifted single-differenced phase clocks in Part 9.2 are reduced by the clock errors estimated in Part 9.4:




  
    
      
        
          N
          
            i
            ⁢
            
              
            
            ⁢
            1
          
          
            
              j
              1
            
            ⁢
            
              j
              2
            
          
        
        ≈
        
          
            1
            
              λ
              NL
            
          
          ⁢
          
            
              (
              
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      t
                      _
                    
                    Φ
                    
                      
                        j
                        1
                      
                      ⁢
                      
                        j
                        2
                      
                    
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      t
                      ~
                    
                    
                      Φ
                      ,
                      i
                    
                    
                      
                        j
                        1
                      
                      ⁢
                      
                        j
                        2
                      
                    
                  
                
              
              )
            
            .
          
        
      
    
    
      
        (
        73
        )
      
    
  




What remains is an observable for the integer narrowlane offset. For each station a narrowlane filter with a narrowlane ambiguity state per satellite is updated with those observations.
Part 9.6 High-Rate Single-Differenced Code-Leveled Clocks
The phase clock processor 335 also computes high-rate code-leveled clocks.
Part 9.6.1 Buffering Low-Rate Code-Leveled Clocks
GNSS observations (reference station data 305 or 315) for a time (e.g., an epoch) t1 are buffered for use when the low-rate information with the same time tag (t1) arrives from the code-leveled clock processor 360; this information comprises two of: clock errors 365, tropospheric delays 370, and ionospheric-free float ambiguities 374. Thus, GNSS observations matched in time with the low-rate clock processor information are always available from an observation buffer. When a set of low-rate code leveled clocks 365 arrive they are combined with the GNSS observations and with the tropospheric delays 370 and with time-matched satellite position/velocity information 350 to compute the carrier ambiguities.
FIG. 24 shows at 2700 the flow of data for the case where the satellite clocks (clock errors) 365 and the tropospheric delays 370 are used. GNSS observations arrive over time at the phase clock processor 335 with (e.g. epoch) time tags t0, t1, t2, t3, etc. Low-rate code leveled clocks cΔtPj and tropospheric delays T arrive asynchronously over time with time tags t0, t1, t2, t3, etc. An observation buffer 2705 holds the observations. These are combined for each time ti in a combiner 2710 with satellite position/velocity data, with the low-rate code-leveled clocks cΔtPj and with the tropospheric delays T to produce the ionospheric-free float ambiguity terms λNij:=λIFNi,IFj+bΦ, i,IF−bP,i,IF−(bΦ,IFj−bP,IFj). A process 2715 computes the single-differenced code-leveled clocks 2720.
If the low rate processor sends the float ambiguities, the buffering of observations is not needed. The float ambiguities can directly be used for future observations.
Part 9.6.2 Computing Iono-Free Float Ambiguities in the Phase Clock Processor
The data combiner (2710) forms an ionospheric-free linear combination of the carrier-phase observation, and reduces this by the geometric range ρij (computed using the receiver and satellite positions), the tropospheric delay Tij and the low-rate code-leveled satellite clock error cΔtPj (e.g., clocks 365). After this reduction the receiver clock error and a float ambiguity remains. If this is done using between-satellite single-differenced observations, the receiver clock is eliminated and thus only the single-differenced ionospheric-free ambiguity term remains:

Φi,IFj1j2(t1)−ρij1j2(t1)−Tij1j2(t1)+cΔtPj1j2(t1)=λNij1j2(t1)+εΦ,i,IFj1j2(t1).  (74)

with cΔtPj1j2:=cΔtj1j2+bP,IFj1j2 and float ambiguity λNij1j2:=λIFNi,IFj1j2−(bΦ,IFj1j2−bP,IFj1j2) which is a constant value and is kept to be used until the next update of low rate clocks.

As an alternative to computing the ionospheric-free ambiguities in the phase clock processor 335, the ionospheric-free float ambiguities are obtained from a previous processor, such as ionospheric-free float ambiguities 374 from the low-rate code clock processor 320.
Part 9.6.3 Using Iono-Free Float Ambiguities to Compute High Rate Code Clocks
Once iono-free ambiguities are known for time t1, single-differenced ionospheric-free linear combinations at any time in the future (e.g. t2) can be used for each pair of satellites along with tropospheric delay and current geometric range:

Φi,IFj1j2(t2)−ρij1j2(t2)−Tij1j2(t1)−λNij1j2(t1)=−cΔtPj1j2(t2)+εΦ,i,IFj1j2(t2)+εΦ,i,IFj1j2(t1)  (75)

The result of this computation is the single-differenced code-leveled satellite clock error cΔtPj1j2. With this it is possible to estimate high-rate single-differenced code-leveled clock errors cΔtPjrefj2 between a given satellite j2 and a chosen reference satellite jref. If only the between-satellite single-differenced clock errors are of interest, the reference satellite clock error cΔtPjref is set to zero, otherwise the reference clock can be steered to the corresponding broadcast or low rate clock to shift the clocks to an absolute level. For simplicity FIG. 25A to FIG. 25C do not include this shift.

FIG. 25A shows a first embodiment 2800 for preparing the high-rate code-leveled satellite clocks 375. Precise satellite orbit information, e.g., satellite position/velocity data 350 or 360, and GNSS observations, e.g., reference station data 305 or 315, are supplied as inputs to a first process 2805 and as inputs to a second process 2810. The first process 2805 estimates a set of ionospheric-free float ambiguities 2815. These are supplied to the second process 2810 which estimates the high-rate code-leveled satellite clocks (clock errors) 375.
FIG. 25B shows a second embodiment 2820 for preparing the high-rate code-leveled satellite clocks 375. Precise satellite orbit information, e.g., satellite position/velocity data 350 or 360, and GNSS observations, e.g., reference station data 305 or 315, are supplied as inputs to a low-rate code-leveled clock processor 2825, e.g., code clock processor 320, and as inputs to a high-rate code-leveled clock processor 2830. The low-rate code-leveled clock processor 2825 prepares ionospheric-free float ambiguities 2835, e.g., ionospheric-free float ambiguities 374, and tropospheric delays 2840, e.g., tropospheric delays 370. The ionospheric-free float ambiguities 2835 and the tropospheric delays 2840 are supplied to the high-rate code-leveled clock processor 2830, e.g., forming a part of phase clock processor 335. The high-rate code-leveled clock processor 2830 uses the inputs at 2845 to compute single-differenced high-rate code-leveled satellite clocks 2850 per station. A filter 2855 uses these to estimate qualitatively improved code-leveled satellite clocks (clock errors) 2860, e.g., high-rate code-leveled satellite clocks 375.
FIG. 25C shows a third embodiment 2865 for preparing the high-rate code-leveled satellite clocks 375. Precise satellite orbit information, e.g., satellite position/velocity data 350 or 360, and GNSS observations, e.g., reference station data 305 or 315, are supplied as inputs to a low-rate code-leveled clock processor 2870, e.g., code clock processor 320, and as inputs to a high-rate code-leveled clock processor 2875. The low-rate code-leveled clock processor 2870 prepares low-rate code-leveled clocks 2880, e.g., low-rate code-leveled satellite clocks 365, and tropospheric delays 2882, e.g., tropospheric delays 370. The low-rate code-leveled satellite clocks 2880 and the tropospheric delays 2882 are supplied to the high-rate code-leveled clock processor 2875, e.g., forming a part of phase clock processor 335. The high-rate code-leveled clock processor 2884 uses the inputs at 2884 to compute ionospheric-free float ambiguities 2886 which are used at 2888 to compute single-differenced high-rate code-leveled satellite clocks 2890. A filter 2892 uses these to estimate qualitatively improved high-rate code-leveled satellite clocks (clock errors) 2894, e.g., high-rate code-leveled satellite clocks 375.
Part 9.6.4 Clock Shifter
Single-differenced phase-leveled clock errors cΔtΦjrefj2 and single-differenced code-leveled clock errors cΔtPjrefj2 are estimated as in the course of estimating phase-leveled satellite clocks and high-rate single-differenced code-leveled satellite clocks. The single-differenced high-rate code-leveled satellite clocks have the same accuracy as single differences of the low-rate code-leveled satellite clocks. The phase-leveled satellite clocks are constructed to preserve the integer nature of the narrowlane ambiguity if used for single-differenced ionospheric-free carrier-phase observations together with the precise satellite orbits and the widelane ambiguities, derived from the MW biases, used in the clock estimation. Thus the quality of a single-differenced phase-leveled clock error is not changed if this clock error is shifted by an integer number of narrowlane cycles. Since the phase-leveled satellite clock errors will always be used in a single difference, such a shift which is applied to all satellite clock errors will cancel out again in the single-differencing operation. In accordance with some embodiments the following shift is applied to the phase-leveled satellite clock errors to keep their values close to the low-rate code-leveled satellite clock errors and reduce their noise.
Thus in some embodiments an integer number of narrowlane cycles

sNLjrefj2=Round(cΔtPjrefj2−cΔtΦjrefj2)  (76)

is added to each of the phase-leveled satellite clock errors to minimize the distance to the high-rate code-leveled satellite clocks.

In some embodiments the low-rate code-leveled clock errors are approximated with a continuous steered clock cΔtP,steeredj. The value of the steered clock of the reference satellite

sref=cΔtP,steeredjref  (77)

is then added to all high-rate clocks. Doing so, all clocks are close to the code-leveled low-rate clocks, but the reference clock is smooth.

In some embodiments the mean of the difference between the high-rate phase-leveled satellite clocks and their corresponding steered low-rate clock is computed and added to all shifted phase-leveled satellite clock errors. The same is done for the high-rate code-leveled satellite clocks. This procedure pushes some noise into the reference clock. If the number of clocks used to compute this mean changes, the computed mean can be discontinuous. To handle those jumps one can simply send a jump message or smooth the mean, e.g., by steering to the current value or using a moving average, etc.




  
    
      
        
          
            s
            
              P
              ,
              noise
            
          
          =
          
            
              1
              n
            
            ⁢
            
              
                ∑
                
                  j
                  =
                  1
                
                n
              
              ⁢
              
                (
                
                  
                    c
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      t
                      P
                      
                        
                          j
                          ref
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                  -
                  
                    c
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      t
                      
                        P
                        ,
                        steered
                      
                      
                        
                          j
                          ref
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            S
            
              Φ
              ,
              noise
            
          
          =
          
            
              1
              n
            
            ⁢
            
              
                ∑
                
                  j
                  =
                  1
                
                n
              
              ⁢
              
                (
                
                  
                    c
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      t
                      Φ
                      
                        
                          j
                          ref
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                  -
                  
                    c
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      t
                      
                        P
                        ,
                        steered
                      
                      
                        
                          j
                          ref
                        
                        ⁢
                        
                          j
                          2
                        
                      
                    
                  
                  +
                  
                    s
                    NL
                    
                      
                        j
                        ref
                      
                      ⁢
                      
                        j
                        2
                      
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        78
        )
      
    
  




The shifted clock errors read as

cΔtPj2=cΔtPjrefj2+sP,noise+sref 

cΔtΦj2=cΔtΦjrefj2+sΦ,noise+sref+sNLjrefj2  (79)

The shifting is mainly done to keep the phase-leveled satellite clock errors near GPS time and therefore make certain transmission methods applicable. In addition the clock bias

bΔtj=cΔtPj−cΔtΦj,  (80)

which is the difference between the phase-leveled satellite clocks and code-leveled satellite clocks, can be kept within a certain range.

Part 9.6.5 Jump Messages
If the clock bias leaves its range or if the phase-leveled clocks' satellite-to-satellite links have been estimated without using fixed narrowlane ambiguities, the shift will change and a jump message is sent. This also means that the phase-leveled satellite clock error changes its level.
Part 9.7 Phase Clock Processor Embodiments
FIG. 26 shows an architecture 2900 of a phase clock processor 335 in accordance with some embodiments of the invention. The inputs to the phase clock processor are: MW biases and/or fixed WL ambiguities 2095 (e.g., MW biases 345 and/or fixed WL ambiguities 340), low-rate (LR) code-leveled clocks 2910 (one per satellite, e.g., low-rate code-leveled satellite clocks 365), satellite orbit information (e.g., precise satellite orbit position/velocities 350 and/or IGU orbit data 360), tropospheric delays 2920 (one per reference station, e.g., tropospheric delays 370), and GNSS observations 2925 (of multiple satellites at multiple reference stations, e.g, reference station data 305). The choice of MW biases or fixed WL ambiguities gives two options. A first option is to use the low-rate MW biases together with the low-rate orbit information 2915 and the GNSS observations 2925 in an optional fixer bank 2930 to fix the WL ambiguities. These are then provided at a high rate (HR) as single-differenced fixed WL ambiguities 2935 to a computation process 2940. A second option is use the low-rate fixed WL ambiguities directly to supply single-differenced (SD) fixed WL ambiguities to the process 2940. By high-rate is meant that the single-differenced fixed WL ambiguities used in the high-rate process 2940 remain the same from epoch to epoch in process 2940 between low-rate updates.
The low-rate code-leveled clocks 2910 are used in process 2945 to compute low-rate single-differenced ionospheric-free float ambiguities 2950. These are used with the low-rate orbit data 2915 and the low-rate tropospheric delays 2920 and the high-rate GNSS observations 2925 in a process 2955 to compute single-differenced high-rate code-leveled clocks 2960 (one per satellite, such as high-rate code-leveled satellite clocks 375).
The high-rate single-differenced fixed WL ambiguities 2935 are used with the low-rate orbit data 2915 and the low-rate tropospheric delays 2920 and the GNSS observations 2925 in a process 2940 which computes high-rate phase-leveled clocks 2945 (one per satellite, such as high-rate phase-leveled satellite clocks 375). The high-rate phase-leveled clocks 2945 are used together with the orbit data 2915 and the tropospheric delays 2920 and the GNSS observations 2925 in an ambiguity fixer bank 2975 which attempts to fix single-differenced ambiguities, e.g., L1 ambiguities. The single-differenced fixed ambiguities 2980 are pushed into the process 2965 to aid the computation of high-rate phase-leveled clocks 2970.
The MW biases and/or fixed WL ambiguities 2905 and the low-rate code-leveled clocks 2910 and the single-differenced high-rate code-leveled clocks 2960 and high-rate phase-leveled clocks 2970 are fed into a process 2985 which shifts and combines these to deliver a high rate data flow 2990 containing (at least) high-rate phase-leveled satellite clocks, high-rate code-leveled clocks and high-rate MW biases. Data 2990 is supplied to scheduler 355 as described in FIG. 3.
FIG. 27A shows an embodiment 3000 of a process for estimating high-rate phase-leveled satellite clocks. Precise satellite orbit information, e.g., satellite position/velocity data 350 or 360, and GNSS observations, e.g., reference station data 305 or 315, are supplied at low rate as inputs to a first process 3015 and at high rate as inputs to a second process 3020. The first process 3015 estimates ambiguities 3025, one set of ambiguities per receiver. Each ambiguity corresponds to one of a receiver-satellite link and a satellite-receiver-satellite link. These ambiguities are supplied at low rate to the second process 3020 which estimates the high-rate phase-leveled clocks 3030.
In general a linear combination of carrier phase observations has receiver-dependent parameters pr like receiver position, receiver clock error or receiver biases, satellite-dependent parameters ps like the satellite position, and receiver-satellite-link dependent parameters prs like the tropospheric or the ionospheric delay. Let Ωrks, kεL be linear combinations of code and carrier phase observations with wavelength λk and ambiguity Nrks. A code and carrier phase combination as assumed here can be written as




  
    
      
        
          
            
              Ω
              ^
            
            r
            s
          
          :=
          
            
              
                ∑
                
                  k
                  ∈
                  
                    L
                    ^
                  
                
              
              ⁢
              
                
                  a
                  k
                
                ⁢
                
                  Ω
                  rk
                  s
                
              
            
            =
            
              
                f
                ⁡
                
                  (
                  
                    
                      p
                      r
                    
                    ,
                    
                      p
                      s
                    
                    ,
                    
                      p
                      r
                      s
                    
                  
                  )
                
              
              +
              
                c
                ⁢
                
                  
                
                ⁢
                Δ
                ⁢
                
                  
                
                ⁢
                
                  t
                  s
                
              
              +
              
                
                  ∑
                  
                    k
                    ∈
                    
                      L
                      ^
                    
                  
                
                ⁢
                
                  
                    a
                    k
                  
                  ⁡
                  
                    (
                    
                      
                        b
                        k
                        s
                      
                      +
                      
                        
                          λ
                          k
                        
                        ⁢
                        
                          N
                          rk
                          s
                        
                      
                    
                    )
                  
                
              
              +
              
                ɛ
                r
                s
              
            
          
        
        ,
      
    
    
      
        (
        81
        )
      
    
  




with {circumflex over (L)}⊂L, {circumflex over (L)} not empty and real factors akε.

Note that f:np→ is linear in most of the parameters. If a mapping exists to convert between a receiver-satellite link dependent parameter and a receiver dependent parameter, it can be used to reduce the number of unknowns. As an example the troposphere delay can be modeled as a delay at zenith, which is mapped to line of sight. Thus instead of having one parameter per receiver-satellite link, only one parameter per receiver is needed.
Using special linear combinations such as an ionospheric-free combination, parameters can be canceled out. Each additional input of at least one of the parameters contained in pr, ps and prs simplifies and accelerates the estimation process. In satellite-receiver-satellite single differences the parameters pr cancel out. In the following all can be done in single or zero difference, but this will not be mentioned explicitly in each step.
If all parameters pr, ps, prs and cΔts are known and the noise is neglected, the remaining part




  
    ∑
    
      k
      ∈
      
        L
        ^
      
    
  
  ⁢
  
    
      a
      k
    
    ⁡
    
      (
      
        
          b
          k
          s
        
        +
        
          
            λ
            k
          
          ⁢
          
            N
            rk
            s
          
        
      
      )
    
  




is not unique without additional information. Setting the ambiguities for a specific satellite-receiver combination to zero will shift the biases accordingly. If the ambiguities are known, the level of the bias is defined; if the bias is known, the level of ambiguities is defined.

In some linear combinations Ωrks of code and carrier-phase observations the parameter pr, ps, prs and cΔts cancel out, as do the receiver biases brk. This allows estimating the biases bks, brk and the ambiguities Nrks separated from the other parameter.
Not all satellite biases can be estimated separately from the satellite clock error cΔts. In this case the sum of the real satellite clock and the biases are estimated together and the result is just referred as the satellite clock error. In this case shifting a bias is equivalent with shifting a clock.
In the following a distinction is made between ambiguities belonging to biases and ambiguities belonging to clock errors. The clock ensemble and also the biases ensemble estimated from GNSS observations are underdetermined. Thus one of the satellite or receiver clock errors/biases or any combination of them can be set to any arbitrary value or function to make the system solvable. In some embodiments one of the clocks/biases is set to zero, or additional measurements or constraints for one of the clock errors/biases or a linear combination of clock errors/biases are added. The examples given here always have a reference clock/bias set to zero, for purposes of illustration, but this is not a requirement and another approach can be used.
Process I (3015):
In a first step all other input parameters are used to reduce the linear combination of carrier phase observations. Depending on the linear combination used, there are small differences in how to estimate phase-leveled satellite clock errors. One option is to use a single, big filter: In this case, all remaining unknown parameters of pr, ps and prs, the satellite clock errors, including biases, and all ambiguities of {circumflex over (Ω)}rs, are modeled as states in one filter, e.g. a Kalman filter. As an example the filter used for orbit determination in Part 8 (Orbit Processor), the one used for code-leveled clocks in Part 6 (Code-Leveled Clock Processor) (except the integer nature of ambiguities) or the Melbourne-Wübbena bias processor in Part 7 (MW Bias Processor) can be used. Another option is to perform a hierarchical estimation.
In some embodiments using linear combinations Ωrks of code and carrier-phase observations in which the parameters pr, ps, prs and cΔts cancel out, the biases and ambiguities of Ωrks estimated in an auxiliary filter and can be used to simplify the main filter.
Another option is to use a bank of filters rather than a single filter or rather than a main filter with auxiliary filter. If all parameter beside the ambiguities are known, in at least one of the code and carrier-phase combinations {circumflex over (Ω)}rs or Ωrks, kε{circumflex over (L)} the ambiguities can be estimated in a filter bank with one filter for each ambiguity or one filter for each receiver. This is done for single-differenced observations in the phase clock processor to estimate the widelane ambiguities using the Melbourne-Wübbena linear combination and Melbourne-Wübbena biases as input.
A further option is to use a combination of a main filter with a bank of filters. In some embodiments the results of the filter banks are used to reduce the carrier-phase combinations {circumflex over (Φ)}rsin the main filter used to estimate the remaining unknowns.
At least one set of fixed ambiguities is sent from process I (3015) to process II (3020), but all the estimated parameters could be sent in addition.
Process II (3025):
In process II the linear combination {circumflex over (Ω)}rs is reduced by all input parameters from process I or additional sources. If no fixed ambiguities are available for the ambiguities from process I that belong to the clock error, a subset of those ambiguities defined e.g. by a spanning tree is in some embodiments set to any arbitrary integer number and used like fixed ambiguities as discussed above. If this subset changes or is replaced by fixed ambiguities of process I, the resulting satellite phase clock errors may change their level. All remaining unknowns are modeled as states in a filter, e.g. a Kalman filter.
As in FIG. 27A, some embodiments estimate the ambiguities at a first rate and estimate a phase-leveled clock per satellite at a second rate higher than the first rate. The ambiguities estimated in process I (3005) are constant as long the receiver has no cycle slip. Thus an estimated ambiguity can be used for a long time. Also some of the other states like the troposphere estimated in process I (3005) vary slowly and can be assumed to be constant for a while. If the observations of process II (3020) are reduced by those constant and slowly varying parameters, the filter used to estimate clock errors has only a view unknowns left and is therefore quite fast. In general, processor II can work at a higher update rate than process I.
FIG. 28 shows an embodiment 3100 in which estimating a phase-leveled clocks per satellite comprises using at least the satellite orbit information, the ambiguities and the GNSS signal data to estimate a set of phase-leveled clocks per receiver, each phase-leveled clock corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link; and using a plurality of the phase-leveled clocks to estimate one phase-leveled clock per satellite. The satellite orbit information 3105 (e.g, 350 or 360) and the GNSS observations 3110 (e.g., 305 or 315) are used in a first process 3115 to determine the ambiguities 3120. The ambiguities 3120 are used with the satellite orbit information 3105 and the GNSS observations 3110 in a second process 3125 to estimate the set of phase leveled clocks 3130, each phase-leveled clock corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link. These are used in a third process 3135 to estimate satellite clocks 3140, one per satellite.
This means, instead of having a big filter in the second process, the problem can be decoupled using a small filter for each satellite-to-satellite link to estimate clock errors per receiver-satellite link or in single difference case per satellite-receiver-satellite link. Afterwards those clock errors per link can be combined either using only links defined by a spanning tree (e.g., as at 3058) or using a filter with one clock error state per satellite.
In some embodiments, the ambiguities are estimated using at least one previously-estimated phase-leveled clock per satellite. As mentioned above, the known fixed ambiguities define the clock error level, and (vice versa) a known clock error leads to ambiguities fitting this clock error. Thus the feedback of clock error estimates to process I allows to estimate ambiguities without having a dedicated clock error state. Since process II can already produce clock error estimates before having all ambiguities fixed, this feedback is advantageous in such a scenario to fix ambiguities belonging to clock errors. FIG. 29 shows one such embodiment 3200. The satellite orbit information 3205 (e.g., 350 or 360) and the GNSS observations 3210 (e.g., 305 or 315) are used in a first process 3215 to determine the ambiguities 3220. The ambiguities 3220 are used with the satellite orbit information 3205 and the GNSS observations 3210 in a second process 3225 to estimate the set of phase leveled clocks 3230. These are fed back to the first process 3215 where they are used in estimating the ambiguities 3220.
Two more detailed realizations of this process are illustrated in FIG. 27B and FIG. 27C.
FIG. 27B is a simplified schematic diagram of an alternate phase clock processor embodiment 3035 with WL ambiguities input as in option 2 of FIG. 26 (compare with process 2965). Satellite orbit data 3005 (e.g., 350 or 360), GNSS observations 3010 (e.g., 305 or 315), tropospheric delays 3040 (e.g., 370) and fixed WL ambiguities 3045 (e.g., 340) are supplied to a filter bank 3050 of process I (3015). Filter bank 3050 estimates single-differenced free narrowlane ambiguities 3055. The SD free NL ambiguities 3055 and the fixed WL ambiguities 3045 are combined in a process 3060 with the satellite orbit data 3005, the GNSS observations 3010, and the tropospheric delays 3040 to compute single-differenced satellite clocks 3062. These are applied to a narrowlane filter bank 3064 to estimate single-differenced-satellite clocks 3066. A spanning tree process 3068 (e.g. MST) is applied to these to produce a set of single-differenced satellite clocks 3070. These are fed back to the filter bank 3050 of process I (3015) to improve the estimation of the single-differenced free narrowlane ambiguities 3055.
FIG. 27C is a simplified schematic diagram of an alternate phase clock processor embodiment 3075 with MW biases input as in option 1 of FIG. 26 (compare with process 2965). Satellite orbit data 3005 (e.g., 350 or 360), GNSS observations 3010 (e.g., 305 or 315), tropospheric delays 3040 (e.g., 370) and fixed WL ambiguities 3045 (e.g., 340) are supplied to a filter bank 3078 of process I (3015). Filter bank 3078 estimates single-differenced free narrowlane ambiguities 3088. A filter bank 3082 uses the MW satellite biases 3045 to estimate WL ambiguities 3084. As in FIG. 27B, the SD free NL ambiguities 3055 and the fixed WL ambiguities 3084 are combined in a process 3060 with the satellite orbit data 3005, the GNSS observations 3010, and the tropospheric delays 3040 to compute single-differenced satellite clocks 3062. These are applied to a narrowlane filter bank 3064 to estimate single-differenced-satellite clocks 3066. A spanning tree process 3068 (e.g. MST) is applied to these to produce a set of single-differenced satellite clocks 3070. These are fed back to the filter bank 3078 of process I (3015) to improve the estimation of the single-differenced free narrowlane ambiguities 3080.
Using clock error estimates from a second phase clock processor as input to process I allows to estimate ambiguities fitting those clocks and finally to estimate satellite clock errors at the same level as the other processor's clock errors. For this embodiment it is advantageous to have a secondary clock processor as a back up which is available to immediately provide clock error estimates without level change in case of a failure of the primary clock processor.
In some embodiments at least one additional phase-leveled clock per satellite estimated from an external source is obtained and used to estimate the ambiguities. FIG. 30 shows one such embodiment 3300. In part 3335, the satellite orbit information 3305 (e.g., 350 or 360) and the GNSS observations 3310 (e.g., 305 or 315) are used in a first process 3315 to determine the ambiguities 3320. The ambiguities 3320 are used with the satellite orbit information 3305 and the GNSS observations 3310 in a second process 3325 to estimate the set of phase leveled clocks 3330. In part 3385, the satellite orbit information 3355 (e.g, 350 or 360) and the GNSS observations 3360 (e.g., 305 or 315) are used with one or more of satellite clocks 3330 in a first process 3365 to estimate the ambiguities 3370. In this embodiment part 3335 is an external source of the satellite clocks 3330 with respect to part 3385. The ambiguities 3370 are used with the satellite orbit information 3355 and the GNSS observations 3360 in a second process 3375 to estimate the set of phase leveled clocks 3380.
In some embodiments, at least one set of ambiguities per receiver is determined for additional receivers, each ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link. After determining the ambiguities for the additional receivers, at least the precise orbit information, the ambiguities for the additional receivers and the GNSS signal data are used to estimate the at least one additional phase-leveled clock per satellite.
FIG. 31 shows one such embodiment 3400. In part 3455, the satellite orbit information 3405 (e.g, 350 or 360) and the GNSS observations 3310 (e.g., 305 or 315) are used in a first process 3415 to determine the ambiguities 3420. The ambiguities 3420 are used with the satellite orbit information 3405 and the GNSS observations 3410 in a second process 3425 to estimate the set of phase leveled clocks 3430. In part 3485, the satellite orbit information 3455 (e.g, 350 or 360, but optionally from a different orbit processor associated with a different network of reference stations) and the GNSS observations 3410 (e.g., 305 or 315, but optionally from a different network of reference stations) are used with one or more of satellite clocks 3430 in a first process 3465 to estimate the ambiguities 3470. The ambiguities 3470 are used with the satellite orbit information 3455 and the GNSS observations 3460 in a second process 3475 to estimate the set of phase leveled clocks 3480.
The primary and secondary clock processors can also be of different kind. This option can be used to estimate the ambiguities close to the level of clock errors based on a different linear combination (e.g. code clock error or different phase combination). Using those ambiguities in process II will lead to clock errors close to clock errors input in process I.
Part 10: Scheduler & Message Encoder
The scheduler 355 and message encoder 385 can be implemented as desired. Methods and apparatus for encoding and transmitting satellite information are described for example in Patent Application Publications US 2009/0179792 A1, US2009/0179793 A1, US2010/0085248 A1, US2010/0085249 A1 and/or US2010/0214166 A1.
Part 11: Rover Processing with Synthesized Reference Station Data
Part 11.1 Introduction
Existing RTK rover positioning engines are typically designed to process differenced data; the rover data is differenced with base station data and the filters operate on the differenced data. The GNSS observations are contaminated with a number of errors such as satellite clock error, receiver clock error, troposphere delay error, and ionospheric delay error. The satellite-dependent errors (e.g. satellite clock error) can be eliminated if the difference between the observations of two receivers observing the same satellite is used. If those receivers are located close enough to each other (e.g. a few kilometers under normal conditions) then the atmosphere-related errors can also be eliminated. In case of VRS (Virtual Reference Station) the difference is done not between two stations, but between the rover station and a virtual station, whose data is generated using observations from a network of receivers. From this network it is possible to create knowledge of how errors behave over the region of the network, allowing differential positioning over longer distances.
Prior approaches for Precise Point Positioning (PPP) and PPP with ambiguity resolution (PPP/RTK) remove modeled errors by applying them as corrections (subtracting the errors) to the rover data. Though this works, using a rover receiver configured to process differenced data requires a change in data preparation in that single-differencing has to be replaced by rover-data-only error correction before the data can be processed.
This implies two different modes of operation inside the rover's positioning engine. In practice this results in separate processors for PPP and RTK. This consumes a lot of software development resource, and occupies more of the rover's CPU memory for the additional modules and data.
Part 11.2 Global Virtual Reference Station Positioning
Some embodiments of the invention are based on a substantially different approach, in which a Synthesized Base Station (SBS) data stream is generated for any position on or near the Earth's surface using precise satellite information (e.g., precise orbits and clocks). This data stream is equivalent to having a real reference station near the rover.
For processing at the rover, a Real-Time Kinematic (RTK) positioning engine is used that is adapted to the different error characteristics of PPP as compared to traditional Virtual Reference Station (VRS) processing. Unlike traditional VRS processing, some embodiments of the invention use a processing approach which does not rely on small ionospheric residuals. And in contrast with traditional VRS processing, some embodiments of the invention optionally process different pseudorange observables.
PPP and PPP/RTK functionality are retained, with comparatively low software development and few changes in the rover positioning engine, while retaining the advantage of well-proven RTK engines that had been developed and perfected with many man-years of development time. Examples of such functionality include processing of data collected under canopy and dealing with delays in the reference data/corrections (low-latency positioning).
PPP-RTK studies using the SBS technique have proven the high performance of such a system. A positioning accuracy of 10 cm horizontal (95%) was achieved after about 600 seconds (mean) when processing a test data set. Convergence to the typical long baseline and VRS survey accuracy of 2.54 cm horizontal (95%) was achieved after 900 seconds (mean). This suggests that SBS techniques described here can provide sub-inch horizontal-positioning performance.
Part 11.3 Generating SBS Data
The SBS technique enables the generation of virtual GNSS data (data from a virtual GNSS reference/base station) for any position on or near the Earth's surface using precise satellite information (e.g., orbits, clocks). The core of the processing is done inside a module which responsible for the generation of the virtual data. The aim of such data generation is to make it possible to use GNSS satellite precise information in a GNSS receiver running a conventional real-time kinematic (RTK) process as is typically used with reference receiver data of a physical base station or virtual reference station. In the SBS technique the receiver's antenna position is computed by the RTK engine with differential GNSS data processing (i.e., difference between observations of a reference receiver and a rover receiver) using the SBS data as coming from the (virtual) reference receiver, and the rover receiver data. The technique therefore allows that a differential GNSS processor is used to compute positions anywhere without the explicit need of a nearby reference station.
The SBS module uses at least one of the following:
Phase-leveled clocks: These are the satellite clock offsets computed as described in Part 9 (Phase-Leveled Clock Processor).
Code-leveled clocks: These are the satellites clock offsets computed as described in Part 6 (Code-Leveled Clock Processor).
Melbourne-Wübbena bias: These are the satellite biases for the Melbourne-Wübbena phase and code combination computed as described in Part 7 (MW Bias Processor).
Jump messages: These messages can indicate whether or not the satellite phase clock had a change of level in the recent past (e.g. 10 minutes). The reasons for a level change are pointed out in Part 9 (Phase-Leveled Clock Processor). Whenever a jump (level change) occurs in the satellite phase clock offset, some action has to be taken on the rover. This action might be the reset of the satellite's ambiguity/ambiguities in the RTK engine.
Approximate rover position: This is the position for which the virtual base data will be generated. The approximate position of the rover can be used for example so that geometric-dependent components (e.g. satellite position) are the same as for the rover data.
Time tag: This is the time (epoch) for which the virtual data is generated. The virtual data is created for certain instants of time (epochs) that depend on the rover observation time tags, so that it can be used in the differential data processing together with the rover data.
Given one or more items of the list above as input, the SBS module generates as output a set of GNSS virtual observations. These observations may comprise and are not restricted to: L1 code, L2 code, L1 phase, L2 phase, L1 cycle slip information, L2 cycle slip information, and/or exact virtual base position. Once the virtual reference station dataset is available it can be delivered to the RTK engine for differential processing with the rover's own GNSS observation data and optionally using the precise satellite data. The RTK engine can then apply conventional RTK processing to compute the rover coordinates.
Part 11.4 Moving Base
The best corrections for kinematic rovers are obtained when the SBS position and the synthesized reference station data for the SBS position are updated frequently, e.g., for every epoch of rover observations a new set of SBS data is generated. Some embodiments use as the SBS position a first estimate of the rover position, derived for example from a simple navigation solution using the rover observations.
In the case of prior-art Virtual Reference Station (VRS) processing, a moving rover can result in a significant separation between the rover position and the VRS location for which the VRS data is synthesized. Some implementations mitigate this by changing the VRS position when this distance exceeds a certain threshold. This can lead to resets of the RTK engine in most implementations.
For attitude determination (heading, blade control etc.), typical RTK processing engines are usually capable of processing data from a moving base station; frequent updating of the SBS position and the synthesized reference station data for the SBS position do not require modification of these rover processing engines.
Part 11.5 SBS Embodiments
FIG. 34 shows an embodiment 3800 of SBS processing in accordance with the invention. Rover receiver 3805 receives GNSS signals from multiple GNSS satellites, of which three are shown at 3810, 3815 and 3820. Receiver 3805 derives GNSS data 3825 from code observations and carrier-phase observations of the GNSS signal over multiple epochs.
Precise satellite data 3830 for the GNSS satellites are received, such as via a correction message 390 broadcast by a communications satellite 3835 or by other means, and decoded by a message decoder 3832. A SBS module 3835 receives the precise satellite data 3830 and also receives information which it can use as a virtual base location, such as an approximate rover position with time tag 3842 generated by an optional navigation processor 3845. The approximate rover position is optionally obtained from other sources as described below.
SBS module 3835 uses the precise satellite data 3830 and the approximate rover position with time tag 3842 to synthesize base station data 3850 for the virtual base location. The base station data 3850 comprises, for example, synthesized observations of L1 code, L2 code, L1 carrier-phase and L2 carrier-phase, and optionally includes information on L1 cycle slip, L2 cycle slip, and the virtual base location. The SBSD module 3835 is triggered by an event or arrival of information which indicates that a new epoch of synthesized base station data is to be generated. In some embodiments the trigger is the availability of a rover observation epoch data set. In some embodiments the trigger is the current rover time tag, In some embodiments one epoch of synthesized base station data 3850 is generated for each epoch of GNSS data observations 3825. In some embodiments the trigger is the availability of an updated set of precise satellite data 3830.
In some embodiments a differential processor 3855, such as a typical RTK positioning engine of an integrated GNSS receiver system 3700, receives the precise satellite data 3830, the synthesized base station data 3850, and the GNSS data 3825 of rover receiver 3805, and uses these to determine a precise rover position 3860. Synthesized base station data 3850 is substituted for base station data in such processing.
FIG. 35 shows clock prediction between an observation time Obs 0 and a subsequent observation time OBs 1.
FIG. 36 is a schematic block diagram of the SBS module 3835.
The SBS module 3835 uses at least one of the following:
Phase-leveled clocks 370: These are the satellite clock offsets computed as described in Part 9: Phase Clock Processor.
Code-leveled clocks 365: These are the satellite clock offsets computed as described in Part 6: Standard Clock Processor;
Melbourne-Wübbena biases 345: These are the satellite biases for the Melbourne-Wübbena phase and code combination computed as described in Part 8: Widelane Bias Processor;
Jump messages (e.g., from correction message 390): Jump messages indicate when the satellite phase clock has had a change of level in the recent past (e.g. 10 minutes). The reasons for a level change are pointed out in Part 9: Phase Clock Processor. When a jump (level change) in the satellite phase clock offset is indicated, action is taken at the rover such as reset of the satellite's ambiguity(ies) in the RTK engine.
Approximate rover position 3840: This is the position for which the virtual base data will be generated. The approximate position of the rover can be used so geometric-dependent components (e.g. satellite position) are the same as for the rover data.
Time tag 3842: This is the time for which the virtual data is to be generated. The synthesized base station data 3850 is created for certain instants of time that depend on the rover observation time tags, so that it can be used in the differential data processing together with the rover data.
Given one or more of these items as input the SBS module 3850 generates as output 3850 a set of GNSS virtual observations. These observations comprise and are not restricted to: L1 code, L2 code, L1 phase, L2 phase, L1 cycle slip information, L2 cycle slip information, and exact virtual base position. The virtual base station is delivered to the differential processor 3855 as is the rover's GNSS data 3825 and, optionally, the precise satellite data 3830. The differential processor 3855 computes the coordinates of the precise rover position 3860, e.g., using a conventional RTK receiver processing approach (see, for example, P. Misra et al., Global Positioning System: Signals, Measurements, and Performance, 2d Edition (2006), pp. 239-241, and U.S. Pat. No. 5,610,614 issued 11 Mar. 1997 to Talbot et al.).
At any instant the SBS module 3835 may receive one or more of the following: approximate rover position 3840, precise satellite data 3830, and/or a time tag 3842. The approximate rover position 3840 is stored at 4005 as an updated current virtual base position. The precise satellite data 3840 is saved at 4010. The time tag 3842 is saved at 4015. Any of these items, or an optional external trigger 4020, can be used as a trigger event at decision point 4025 begin the generation of a new set of synthesized base station data 3850.
The satellite data for the current time tag is evaluated at 4030. This means that the satellite position and clock error that are stored are converted to the correct transmission time of the signal, so they can be consistently used with the rover observations. This is done because the stored satellite position and clock errors do not necessarily match the time tag of each requested epoch of the SBS module. The precise satellite data set for the current time tag 4035 is used at 4040 to synthesize a base station data set for the current time tag. At 4040, the satellite position and satellite velocity are computed for the current time tag. The geometric range between the virtual base station i and the satellite j is computed for example as:

ρij=√{square root over (((Xj−Xi)2+(Yj−Yi)2+(Zj−Zi)2))}{square root over (((Xj−Xi)2+(Yj−Yi)2+(Zj−Zi)2))}{square root over (((Xj−Xi)2+(Yj−Yi)2+(Zj−Zi)2))}  (82)

    where Xj, Yj, Zj is the satellite position at the time of the current time tag, and Xi, Yi, Zi, is the virtual base station location at the time of the current time tag.


The neutral atmosphere (or, troposphere) delay Tij is computed for example using a prediction model. E For examples of prediction models see [Leandro 2009], [Leandro et al. 2006a], or [Leandro et al. 2006b].
The ionospheric delay Iij for L1 frequency is computed for example using an ionosphere model. This can be a prediction model, such as the GPS broadcast ionosphere model [ICD-GPS], or something more sophisticated. Optionally the ionospheric delay can be set to zero.
The uncorrected synthesized base station data set for the time of the time tag is then computed for example as:




  
    
      
        
          Φ
          
            i
            ,
            1
          
          
            j
            ⁢
            
              
            
            ⁢
            ′
          
        
        =
        
          
            ρ
            i
            j
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              Φ
              j
            
          
          +
          
            T
            i
            j
          
          -
          
            I
            i
            j
          
        
      
    
    
      
        (
        83
        )
      
    
  
  
    
      
        
          Φ
          
            i
            ,
            2
          
          
            j
            ⁢
            
              
            
            ⁢
            ′
          
        
        =
        
          
            ρ
            i
            j
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              Φ
              j
            
          
          +
          
            T
            i
            j
          
          -
          
            
              
                f
                1
                2
              
              
                f
                2
                2
              
            
            ⁢
            
              I
              i
              j
            
          
        
      
    
    
      
        (
        84
        )
      
    
  
  
    
      
        
          P
          
            i
            ,
            1
          
          
            j
            ⁢
            
              
            
            ⁢
            ′
          
        
        =
        
          
            ρ
            i
            j
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              P
              j
            
          
          +
          
            T
            i
            j
          
          +
          
            I
            i
            j
          
          +
          
            
              
                f
                2
              
              
                f
                1
              
            
            ⁢
            
              (
              
                
                  
                    λ
                    WL
                  
                  ·
                  
                    b
                    MW
                    j
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    Φ
                    j
                  
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    P
                    j
                  
                
              
              )
            
          
        
      
    
    
      
        (
        85
        )
      
    
  
  
    
      
        
          P
          
            i
            ,
            2
          
          
            j
            ⁢
            
              
            
            ⁢
            ′
          
        
        =
        
          
            ρ
            i
            j
          
          -
          
            c
            ⁢
            
              
            
            ⁢
            Δ
            ⁢
            
              
            
            ⁢
            
              t
              P
              j
            
          
          +
          
            T
            i
            j
          
          +
          
            
              
                f
                1
                2
              
              
                f
                2
                2
              
            
            ⁢
            
              I
              i
              j
            
          
          +
          
            
              
                f
                1
              
              
                f
                2
              
            
            ⁢
            
              (
              
                
                  
                    λ
                    WL
                  
                  ·
                  
                    b
                    MW
                    j
                  
                
                -
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    Φ
                    j
                  
                
                +
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  Δ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    t
                    P
                    j
                  
                
              
              )
            
          
        
      
    
    
      
        (
        86
        )
      
    
  




where Φi,1j′ is the synthesized L1 carrier observation for the virtual base location,

Φi,2j′ is the synthesized L2 carrier observation for the virtual base location,
Pi,1j′ is the synthesized L1 code observation for the virtual base location, and
Pi,2j′ is the synthesized L2 code observation for the virtual base location.
The uncorrected synthesized base station data set 4045 is corrected at 4050 to create a synthesized base station data set 3850 for the current time tag. The corrections includes one or more of the effects described in Part 3: Observation Data Corrector, such as solid earth tides, phase wind-up, and antenna phase center variation. The corrected synthesized base station data set is:

Φi,1j=Φi,1j′−Ci,1j  (87)

Φi,2j=Φi,2j′−Ci,2j  (88)

Pi,1j=Pi,1j′−Ci,1j  (89)

Pi,2j=Pi,2j′−Ci,2j  (90)

The synthesized base station data set generation is then complete for the current time tag and is delivered to the differential processor 3855.

In some embodiments the differential processor 3855 uses the broadcast ephemeris to determine the satellite position and clock error, as in this mode of positioning only approximate quantities are needed for the satellite. This is also true when the differential processor is using SBS data, however in some embodiments the processor optionally uses the available precise satellite data.
FIG. 37 shows an alternate embodiment 4200 which is a variant of the processing 3800 of FIG. 34. In this embodiment the precise satellite data 3830 and rover observation data 3825 are sent to a PPP (Precise Point Positioning) engine 4210 rather or in addition to the differential processor 3855. The PPP engine 4210 delivers the rover coordinates in place of or in addition to those from the differential processor 3855.
FIG. 38 is a simplified view of the embodiment of FIG. 34. The synthesized GNSS data 3850 is created for a given location using precise satellite data 3830. The synthesized data 3850 is forwarded to the differential processor 3855 which, also using the rover GNSS data 3825, computes the rover position 3860.
FIG. 39 is a timing diagram of a low-latency version of the processing of FIG. 34, FIG. 37 or FIG. 39. In this variant, the arrival an epoch of rover observation data (e.g., 3825) or an epoch time tag (e.g., 3842) is used as a trigger for the generation of synthesized base station data (e.g., 3850). For example, a set of synthesized base station data (e.g., 3850) is generated for each epoch of rover observation data (e.g., 3825). The virtual base location (e.g., approximate rover position 3840) is updated from time to time as indicated by timing marks 4402-4408. Precise satellite data (e.g., precise satellite data 3830) is received from time to time as indicated by timing marks 4410-4424. Rover data (e.g., rover observations 3825) are received from time to time as indicated by timing marks 4426-4454. The arrivals of virtual base locations, the precise satellite data and the rover data are asynchronous. Each arrival of an epoch of rover data (indicated by a respective one of timing marks 4426-4454) results in the generation of a corresponding set of virtual base station data (indicated by a respective one of timing marks 4456-4484). In each case it is preferred to use the latest virtual base station location and the latest precise satellite data when processing an epoch of rover observation data with the corresponding virtual base station data. Each pairing of rover data and virtual base station data, e.g., of timing mark pair 4424 and 4456, results in the generation of a corresponding rover position, e.g, of timing mark 4485. Generated rover positions are indicated by timing marks 4485-4499.
In some embodiments a new SBS data epoch is created at each time a new rover data epoch is observed. FIG. 40 is a timing diagram of a high-accuracy version of the processing of FIG. 34, FIG. 37 or FIG. 38. In this variant, the arrival of a set of precise satellite data (e.g., 3830) is used as a trigger for the generation of synthesized base station data (e.g., 3850). For example, a set of synthesized base station data (e.g., 3850) is generated for each set of precise satellite data (e.g., 3850). The virtual base location 3840 (e.g., approximate rover position) is updated from time to time as indicated by timing marks 4502-4508. Precise satellite data (e.g., precise satellite data 3830) are received from time to time as indicated by timing marks 4510-4524. Synthesized base station data (e.g., 3850) are generated for example from each new set of precise satellite data, as indicated by timing marks 4526-4540. Rover data (e.g., rover observations 3825) are received from time to time as indicated by timing marks 4542-4570. The arrivals of virtual base locations, the precise satellite data and the rover data are asynchronous, but in this variant the synthesized base station data sets are synchronized (have the same time tags) as with precise satellite data sets, e.g., indicated by timing marks 4510 and 4526, 4512 and 4528, etc. Each new epoch of rover data is processed using the most recent synthesized base station data set. For example the rover data epochs arriving at timing marks 4544 and 4536 are processed using synthesized base station data prepared at timing mark 4526, etc.
In some embodiments a new SBS data epoch is created each time a new precise satellite data set is obtained. FIG. 41 shows a variant 4600 of the process of FIG. 34, FIG. 37 or FIG. 38 in which the virtual base location 4605 is taken from any of a variety of sources. Some embodiments take as the virtual base location 4605 (a) the autonomous position 4610 of the rover as determined for example by the rover's navigation engine 3845 using rover data 3825. Some embodiments take as the virtual base station location 4605 (b) a previous precise rover position 4615 for example a precise rover position 4220 determined for a prior epoch by differential processor 3855 or by PPP engine 4210. Some embodiments take as the virtual base location 4605 (c) the autonomous position 4610 of the rover as determined for example by the SBS module 3835 using rover data 3825. Some embodiments take as the virtual base location 4605 (d) the autonomous position 4610 of the rover as determined for example by the SBS module 3835 using rover data 3825 and precise satellite data 3830. Some embodiments take as the virtual base station location 4605 an approximate rover location obtained from one or more alternate position sources 4620, such as a rover position determined by an inertial navigation system (INS) 4625 collocated with the rover, the position of a mobile phone (cell) tower 4630 in proximity to a rover collocated with a mobile telephone communicating with the tower, user input 4635 such as a location entered manually by a user for example with the aid of keyboard 3755 or other user input device, or any other desired source 4640 of a virtual base station location.
Regardless of the source, some embodiments update the virtual base station location 4605 or 3840 from time to time for use by SBS module 3835 as indicated by arrow 4645. The virtual base station location 4605 can be updated for example:
(a) never,
(b) for each epoch of rover data,
(c) for each nth epoch of rover data,
(d) after a predetermined time interval,
(e) when the distance between the approximate rover antenna position (e.g., 3840) or autonomous rover antenna position (e.g., 4610) and the virtual base station location (e.g., 4605) exceeds a predetermined threshold,
(f) when the distance between the approximate rover antenna position (e.g., 3840) or autonomous rover antenna position (e.g., 4610) and the precise rover antenna position (e.g., 4220) exceeds a predetermined threshold,
(g) for each update of the approximate rover antenna position (e.g., 3840),
(h) for each update of the precise rover antenna position (e.g., 4220).
For case (a), the first virtual base station location (e.g., 4605) that is provided to SBS module 3835 is used for the whole period during which the data processing is done. For case (b), the virtual base station location (e.g., 4605) is updated every time a new epoch of the rover data 3825 is collected, as this new epoch can be used to update the rover approximate position 3840 which can be used as the virtual base station location 4805. For cases (b) and (c) the virtual base station location 4605 is updated every time a certain number (e.g., 1 to 10) of epochs of rover data 3825 is collected. In case (d) the virtual base station location 4605 is updated at a certain time interval (e.g., every 10 seconds). Case (e) can be viewed as a mixture of cases (a) and (b), where the current virtual base station location 4605 is kept as long as the distance between the current virtual base station location and the approximate rover antenna position is less than a limiting distance (e.g., 100 m). Case (f) is similar to case (e), except that the distance between the virtual base station location and a recent precise rover position is used. For case (g) the virtual base station location is updated each time the approximate rover antenna position changes. For case (h) the virtual base station location is updated each time the precise rover antenna position changes.
In some embodiments the virtual base station location 3840 used for the generation of the SBS data comes from the autonomous position solution of the rover receiver, e.g., approximate rover position 3840. In some embodiments the virtual base station location 3840 is not the same position as the autonomous position solution, but somewhere close to it.
Some embodiments use as the virtual base station location 3840 a source such as: an autonomously determined position of the rover antenna, a previously determined one of said rover antenna positions, a synthesized base station data generating module (e.g., 3835), a precise rover position (e.g., 4220), a position determined by a PPP engine (e.g., 4210), a position determined by an inertial navigation system (e.g., 4625), a mobile telephone tower location (e.g., 4630), information provided by a user (e.g., 4635), or any other selected source (e.g., 4540).
In some embodiments the virtual base station location 3840 is not kept constant throughout the rover observation period but is updated if certain conditions are met such as: never, for each epoch of rover data, when the distance between an approximate rover antenna position and the virtual base station location exceeds a predetermined threshold, for each update of the rover antenna positions, and for a specific GNSS time interval. In some embodiments a change of the virtual base station location 3840 location is used to trigger the generation of a new SBS epoch of data.
In some embodiments the SBS data is used for any kind of between-station differential GNSS processor, no matter what type data modeling is involved, such as processors using: aided inertial navigation (INS), integrated INS and GNSS processing, normal real-time kinematic (RTK), Instant RTK (IRTK, e.g., using L1/L2 for fast on-the-fly ambiguity resolution), Differential GPS (DGPS) float-solution processing, and/or triple-differenced processing. In some embodiments the SBS data is used in post-processing of rover data. In some embodiments the SBS data is used in real time (i.e., as soon as the rover observation is available and a SBS record can be generated for it). In some embodiments the time tag of the rover matches the time tag of the SBS data within a few milliseconds.
Part 11.5 SBS References
Some references relevant to rover processing include:

    Leandro R. F., Santos, M. C. and Langley R. B., (2006a). “UNB Neutral Atmosphere Models: Development and Performance”. Proceedings of ION NTM 2006, Monterey, Calif., January, 2006.
    Leandro R. F., Santos, M. C. and Langley R. B., (2006b). “Wide Area Neutral Atmosphere Models for GNSS Applications”. Proceedings of ION GNSS 2006, Fort Worth, Tex., September, 2006.
    Leandro, R. F. (2009). Precise Point Positioning with GPS: A New Approach for Positioning, Atmospheric Studies, and Signal Analysis. Ph.D. dissertation, Department of Geodesy and Geomatics Engineering, Technical Report No. 267, University of New Brunswick, Fredericton, New Brunswick, Canada, 232 pp.

Part 12: Rover Processing with Ambiguity Fixing



Part 12.1 Ambiguity Fixing Introduction
The common high accuracy absolute positioning solution (also called Precise Point Positioning, or PPP) makes use of precise satellite orbit and clock error information. This solution also uses iono-free observations because there is no information available about the behavior of the ionosphere for the location of the rover receiver (few cm). High accuracy absolute positioning solutions in this scenario have always been based on float estimates of carrier-phase ambiguities, as it was not possible to maintain the integer nature of those parameters using un-differenced iono-free observations. Another issue concerning the integer nature of un-differenced ambiguities is the presence of non-integer phase biases in the measurements. These biases have to be also present in the correction data (e.g. clocks), otherwise the obtained ambiguities from the positioning filter will not be of integer nature.
Typical observation models used in prior-art processing are:

φ=R+dT−dt+T+Nif  (91)

P=R+dT−dt+T  (92)

where

φ is the phase observation at the rover of a satellite signal (measured data),

P is the code observation at the rover of a satellite signal (measured data),

R is the range from satellite to rover at the transmission time of the observed signals,

dT is the receiver clock (also called herein a code-leveled receiver clock or receiver code clock or standard receiver clock),

dt is the satellite clock (also called herein a code-leveled satellite clock or satellite code clock or standard satellite clock),

T is the tropospheric delay of the satellite to rover signal path, and

Nif is the iono-free ambiguity.

Typical prior-art PPP processing uses the ionospheric-free phase φ and code P observations (measurements) of the signals of multiple satellites along with externally-provided satellite clock information dt in an attempt to estimate values for the receiver position (Xr, Yr, and zr), receiver clock dT, tropospheric delay T and the iono-free float ambiguities NifFloat. The state vector of parameters to be estimated in a Kalman-filter implementation, for each satellite j observed at the rover is thus:




  
    
      
        {
        
          
            
              
                X
                r
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              dT
            
          
          
            
              T
            
          
          
            
              
                N
                if
                
                  j
                  Float
                
              
            
          
        
        }
      
    
    
      
        (
        93
        )
      
    
  




Some embodiments of the invention provide for absolute positioning which takes into account the integer nature of the carrier-frequency ambiguities in real time processing at the rover. By real time processing is meant that the observation data is processed as soon as: (a) the data is collected; and (b) the necessary information (e.g. satellite corrections) are available for doing so. Novel procedures use special satellite clock information so that carrier-phase (also called phase) ambiguity integrity is maintained in the ambiguity state values computed at the rover. The rover's processing engine handles the satellite clock error and a combination of satellite biases that are applied to the receiver observations.
Prior-art PPP engines are not able to use phase-leveled clocks, or at least are not able to take advantage of the integer nature of these clocks. Some embodiments of the invention make use of this new information, e.g., in a modified position engine at the rover.
One goal of using phase-leveled satellite clocks and bias information is to obtain supposed integer ambiguities, which are used to obtain an enhanced position solution which takes advantage of the integer nature of the ambiguities. This improves the position solution (4710) as compared with a position solution (4705) in which the ambiguities are considered to be float numbers, as shown in FIG. 47.
The result of such prior-art PPP processing does not allow the integer nature iono-free ambiguities Nif to be reliably determined, but instead only enables estimation of iono-free float ambiguities NifFloat. The iono-free float ambiguities NifFloat can be viewed as including additional effects that can be interpreted as an error e such that:

NifFloat=[αNWLInteger+βN1Integer]+e  (94)

NifFloat=NifPL+e  (95)

where

    NifFloat is an iono-free float ambiguity representing a combination of an iono-free integer ambiguity NifInteger and an error e
    NWLInteger is a Widelane integer ambiguity
    α is an Widelane ambiguity coefficient
    N1Integer is an L1 integer ambiguity
    β is an L1 ambiguity coefficient
    NifPL is a phase-leveled iono-free ambiguity


In some particular cases it is possible to consider NifFloat≅NifInteger in a practical way. Therefore there are cases where the formulation of the float ambiguity NifFloat as a composition of other two integer-nature ambiguity (as in NifFloat=[αNWLInteger+βN1Integer]+e) is not necessary.
Part 12.2 Determining Iono-Free Phase-Leveled Ambiguities NifPL: Option 1
Some embodiments of the invention are based on eliminating the un-wanted effects, or in other words the iono-free float ambiguity error e to allow determination of iono-free phase-leveled ambiguities NifPL. To eliminate the error e, the phase observation model is redefined:

φ=R+dTp−dtp+T+NifP  (96)

where

dTp is a phase-leveled receiver clock (also called a receiver phase clock),
dtp is a phase-leveled satellite clock (also called a satellite phase clock), and
NifPL is a phase-leveled iono-free ambiguity.
Satellite phase clock dtp in (96) is phase-based and has integer nature and, in contrast to Eq. (94), it can provide phase-leveled ambiguities free of error e, so that:

NifPL=[αNWLInteger+βN1Integer]  (97)

The phase-leveled iono-free ambiguity NifPL is not an integer but yet has an integer nature; the phase-leveled iono-free ambiguity NifPL can be interpreted as a combination of two integer ambiguities. One way of doing so is assuming that it is a combination of a widelane integer ambiguity NWLInteger and an L1 integer ambiguity N1Integer in which the widelane ambiguity coefficient α and the L1 ambiguity coefficient are not necessarily integers.
The phase-leveled clock dtp can be quite different from a standard (code-leveled) satellite clock dt. To avoid confusion, the term dtp is used herein to denote the phase-leveled satellite clock and the term dtc, is used herein to denote the standard (code-leveled) satellite clock, i.e., dtc=dt.
The introduction of the phase-leveled satellite clock term dtp in (96) means that the corresponding receiver clock term dTp is also phase leveled. The term dTp is used herein to denote the phase-leveled receiver clock and the term dTc is used to denote the standard (code-leveled) receiver clock, i.e., dTc=dT. In a positioning engine where phase and code measurements are used simultaneously two clock states are therefore modelled for the receiver; in this formulation these are the phase-leveled receiver clock dTp and the standard (code-leveled) receiver clock dTc.
As mentioned above, typical prior-art PPP processing attempts to estimate values for four parameters for each observed satellite: receiver coordinates Xr, Yr, and Zr, receiver clock dT, tropospheric delay T and the iono-free float ambiguities NifFloat. The introduction of phase-leveled clock terms adds one further parameter to be estimated in the rover engine: phase-leveled receiver clock dTp. The restated observation models are therefore as shown in equations (91) and (92), respectively and reproduced here:

Φ=R+dTp−dtp+T+NifPL  (98)

P=R+dTc−dtc+T  (99)

In this formulation each observation type (phase φ or code P) is corrected with its own clock type (phase-leveled satellite clock dtp or code-leveled satellite clock dtc). Some embodiments of the invention therefore use the phase φ and code P observations (measurements) of the signals of multiple satellites observed at a rover along with externally-provided code-leveled (standard) satellite clock information dtc and phase-leveled satellite clock information dtp to estimate values for range R, code-leveled receiver clock dTc, phase-leveled receiver clock dTp, tropospheric delay T and the iono-free phase-leveled ambiguities NifPL. The state vector of parameters to be estimated in a Kalman-filter implementation, for each satellite j observed at the rover is thus:




  
    
      
        {
        
          
            
              
                X
                r
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              
                dT
                c
              
            
          
          
            
              
                dT
                p
              
            
          
          
            
              T
            
          
          
            
              
                N
                if
                
                  j
                  PL
                
              
            
          
        
        }
      
    
    
      
        (
        100
        )
      
    
  




Part 12.3 Determining Iono-Free Phase-Leveled Ambiguities NifPL: Option 2
A second formulation for handling the phase-leveled information is to substitute for the code-leveled receiver clock dTc, an offset δdTp representing the difference between the code-leveled receiver clock dTc, and the phase-leveled receiver clock dTp:

δdTp=dTc−dTp  (101)

so that equations (91) and (92) become, respectively:

φ=R+dTp−dtp+T+NifPL  (102)

P=R+dTp+δdTp−dtc+T  (103)

Accordingly, some embodiments of the invention use the phase φ and code P observations (measurements) of the signals of multiple satellites observed at a rover along with externally-provided code-leveled (standard) satellite clock information dtc and phase-leveled satellite clock information dtp to estimate values for range R, phase-leveled receiver clock dTp, receiver-clock offset δdTp, tropospheric delay T and the iono-free phase-leveled ambiguities NifPL. The state vector of parameters to be estimated in a Kalman-filter implementation, for each satellite j observed at the rover is thus:




  
    
      
        {
        
          
            
              
                X
                t
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              
                dT
                p
              
            
          
          
            
              
                δ
                ⁢
                
                  
                
                ⁢
                
                  dT
                  p
                
              
            
          
          
            
              T
            
          
          
            
              
                N
                if
                
                  j
                  PL
                
              
            
          
        
        }
      
    
    
      
        (
        104
        )
      
    
  




This second formulation still has five types of parameters to be estimated, but because δdTp is an offset there is less process noise in the Kalman filter than for state vector (100). The advantage of such model as compared to option 1 is that the stochastic model can be setup differently, meaning that the noise level assigned to a clock bias state (e.g. δdTp) can be different from a clock state (e.g. dTc). Assuming that phase- and code-leveled clocks behave in a similar way, the noise level needed for modelling a bias state should be less than for modelling a clock state.
Part 12.4 Determining Iono-Free Phase-Leveled Ambiguities NifPL: Option 3
A third formulation for handling the phase-leveled information is to substitute for the phase-leveled receiver clock dTp an offset −δdTp representing the difference between the phase-leveled receiver clock dTp and the code-leveled receiver clock dTc:

−δdTp=dTp−dTc  (105)

so that equations (91) and (92) become, respectively:

φ=R−dTp+dTc−dtp+T+NifPL  (106)

P=R+dTc+δdTc−dtc+T  (107)

Accordingly, some embodiments of the invention use the phase φ and code P observations (measurements) of the signals of multiple satellites observed at a rover along with externally-provided code-leveled (standard) satellite clock information dtc and phase-leveled satellite clock information dtp to estimate values for range R, code-leveled receiver clock dTc, receiver-clock offset −δdTp, tropospheric delay T and the iono-free phase-leveled ambiguities NifPL. The state vector of parameters to be estimated in a Kalman-filter implementation, for each satellite j observed at the rover is thus:




  
    
      
        {
        
          
            
              
                X
                r
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              
                dT
                c
              
            
          
          
            
              
                
                  -
                  δ
                
                ⁢
                
                  
                
                ⁢
                
                  dT
                  p
                
              
            
          
          
            
              T
            
          
          
            
              
                N
                if
                
                  j
                  PL
                
              
            
          
        
        }
      
    
    
      
        (
        108
        )
      
    
  




This third formulation still has five types of parameters to be estimated, but because −δdTp is an offset there is less process noise in the Kalman filter than for state vector (100).

Part 12.5 Determining Iono-Free Phase-Leveled Ambiguities NifPL: Option 4
A fourth formulation for handling the phase-leveled information first estimates the iono-free float ambiguities NifjFloat using code-leveled (standard) satellite clocks dtc for phase observations φ and for code observations P as in (95), and shifts the iono-free float ambiguities NifjFloat afterward using the phase-leveled clock information to obtain the iono-free phase-leveled ambiguities NifPL.
The starting point for this formulation is:

φ=R+dTc−dtc+T+NifFloat  (109)

P=R+dTc−dtc+T  (110)

Note that (109) and (110) are identical to (91) and (92), since dTc=dT and dtc=dt.

This fourth formulation, as in the typical prior-art PPP processing discussed above, uses the phase φ and code P observations (measurements) of the signals of multiple satellites observed at a rover along with externally-provided code-leveled (standard) satellite clock information dtc to estimate values for range R, code-leveled receiver clock dTc, tropospheric delay T and the iono-free float ambiguities NifFloat. The state vector of parameters to be estimated in a Kalman-filter implementation, for each satellite j observed at the rover is thus:




  
    
      
        {
        
          
            
              
                X
                r
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              
                dT
                c
              
            
          
          
            
              T
            
          
          
            
              
                N
                if
                
                  j
                  Float
                
              
            
          
        
        }
      
    
    
      
        (
        111
        )
      
    
  




As with the prior-art PPP processing, the estimation of parameter values of state vector (111) does not allow the iono-free float ambiguities NifjFloat to be reliably determined as iono-free phase-leveled ambiguities NifPL:

NifFloat=NifPL+e=[αNWLInteger+βN1Integer]+e  (112)

where

    
    
        NifFloat is an iono-free float ambiguity representing a combination of a iono-free phase-leveled ambiguity NifPL and an error e,
        NWLInteger is a Widelane integer ambiguity,
        α is a Widelane ambiguity coefficient,
        N1Integer is an L1 integer ambiguity, and
        β is an L1 ambiguity coefficient.
    
    


This fourth formulation assumes that error e represents the difference between the code-leveled (standard) satellite clock dtc and the phase-leveled satellite clock dtp:

e=dtc−dtp  (113)

so that

NifPL=NifFloat−(dtc−dtp)  (114)

NifPL=[αNWLInteger+βN1Integer]+e−e  (115)

NifPL=[αNWLInteger+βN1Integer]  (116)

To summarize, this fourth formulation obtains iono-free float ambiguities NifFloat from (109) and then shifts each of these by the difference between the standard (code-leveled) satellite clock dtcj and the phase-leveled clock dtpj for the respective satellite j to obtain the iono-free phase-leveled ambiguities NifPL as shown in (114).
For this purpose, the rover can be provided with (1) the standard (code-leveled) satellite clock dtcj and the phase-leveled clock dtpj for each satellite j observed at the rover, or (2) the standard (code-leveled) satellite clock dtcj and a clock bias δtc representing the difference between the standard (code-leveled) satellite clock dtcj and the phase-leveled clock dtpj, or (3) the phase-leveled clock dtpj and a clock bias δtp representing the difference between the phase-leveled clock dtpj and the standard (code-leveled) satellite clock dtcj. These are equivalent for processing purposes as can be seen from (114).
This fourth formulation has advantages and disadvantages. A disadvantage is that it assumes the behavior of the standard (code-leveled) satellite clock dtcj and the phase-leveled clock dtpj for each satellite j observed at the rover is substantially the same over the period of time for the ambiguity was computed. An advantage is that jumps (integer cycle slips) which might occur in the phase clock estimations can be more easily handled in processing at the rover.
Part 12.6 Determining Position Using Melbourne-WüBbena Biases bWLj:
After the iono-free phase-leveled ambiguities NifjPL are determined for a given epoch, they can be single-differenced as ∇abNifPL, single-differenced integer (fixed) widelane ambiguities ∇abNWLInteger can be removed from them to obtain single-differenced L1 float ambiguities ∇abN1Float, and the single-differenced L1 float ambiguities ∇abN1Float can be fixed as single-differenced L1 integer ambiguities ∇abN1Integer.
Single-differenced widelane integer ambiguities ∇abNWLInteger are estimated in a widelane-ambiguity filter which runs in parallel with the geometry filter of the rover's processing engine. The rover receiver is provided with a Melbourne-Wübbena bias bMWj for each of the j satellites in view, e.g., from an external source of data corrections—see Part 7 (MW Bias Processor). Melbourne-Wübbena bias bMWj can be computed as:




  
    
      
        
          
            
              φ
              WL
              j
            
            -
            
              P
              NL
              j
            
          
          
            λ
            WL
          
        
        =
        
          
            N
            WL
            
              j
              Integer
            
          
          +
          
            b
            MW
            j
          
          -
          
            b
            MW
            R
          
        
      
    
    
      
        (
        117
        )
      
    
  




where

φWLj is the widelane carrier-phase combination of rover observations of satellite j
PNLj is the narrowlane code combination of rover observations of satellite j
λWL is the widelane wavelength
NWLjInteger is the widelane integer ambiguity for satellite j
bMWR is the Melbourne-Wübbena bias for the rover R.
The widelane ambiguity filter eliminates the rover's Melbourne-Wübbena bias bWLR by differencing (115) for each pairing of satellites “a” and “b” to obtain the single-differenced widelane integer ambiguities ∇abNWLInteger:




  
    
      
        
          
            ∇
            ab
          
          ⁢
          
            N
            WL
            Integer
          
        
        =
        
          
            
              ∇
              ab
            
            ⁢
            
              (
              
                
                  
                    
                      φ
                      WL
                    
                    -
                    
                      P
                      NL
                    
                  
                  _
                
                
                  λ
                  WL
                
              
              )
            
          
          -
          
            
              ∇
              ab
            
            ⁢
            
              b
              MW
            
          
        
      
    
    
      
        (
        118
        )
      
    
  




where

∇abbMW=bMWa−bMWb  (119)

Once the single-differenced widelane integer ambiguities ∇abNWLInteger are known, they are removed from the single-differenced iono-free phase-leveled ambiguities ∇abNifPL to obtain the single-differenced L1 float ambiguities ∇abN1Float.
The float Kalman filter used to estimate the iono-free phase-leveled ambiguities NifPL (or the iono-free float ambiguities NifjFloat in the third alternate formulation discussed above) also gives CNif, the covariance matrix of the iono-free phase-leveled ambiguities NifPL. Because the widelane ambiguities are integer (fixed) values after their values are found, CNif is the same for NifPL as for NifjFloat.
From (95) it is known that:

∇NifabPL=α∇NWLabInteger+β∇N1abFloat  (120)

where

    
    
        ∇NifabPL is the single-difference phase-leveled iono-free ambiguity (differenced between satellites “a” and “b”)
        ∇NWLabInteger is the single-difference widelane integer ambiguity (differenced between satellites “a” and “b”)
        ∇N1abFloat is the single-difference L1 float ambiguity (differenced between satellites “a” and “b”)
    
    


Therefore




  
    
      
        
          ∇
          
            N
            1
            
              ab
              Float
            
          
        
        =
        
          
            
              ∇
              
                N
                if
                
                  ab
                  PL
                
              
            
            -
            
              α
              ⁢
              
                ∇
                
                  N
                  WL
                  
                    ab
                    Integer
                  
                
              
            
          
          β
        
      
    
    
      
        (
        121
        )
      
    
  




Because ∇NWLabInteger are fixed (integer) values, it is assumed that the respective covariance matrices of the L1 float ambiguities N1abFloat and the iono-free phase-leveled ambiguities NifjPL are related by:

CN1Float=CNifPL·F2  (122)

where

CN1Float is the covariance matrix of the L1 float ambiguities N1jFloat 
CNifPL is the covariance matrix of the iono-free phase-leveled ambiguities NifjPL 
F is a factor to convert the units of the variances from iono-free cycles to L1 cycles.
The desired “fixed” (integer-nature) single-differenced L1 float ambiguities ∇N1abInteger can be determined from the single-differenced L1 float ambiguities ∇N1abFloat and the covariance matrix CN1Float of the L1 float ambiguities N1abFloat using well-known techniques, such as Lambda (Jonge et al. 1994), modified Lambda (Chan et al. 2005), weighted averaging of candidate sets, or others.
Having determined the single-differenced integer widelane ambiguities ∇NWLabInteger and the single-differenced integer L1 ambiguities, integer-nature iono-free ambiguities ∇NifabInteger are determined from:

∇NifabInteger=α∇NWLabInteger+β∇N1abInteger  (123)

The integer-nature iono-free ambiguities ∇NifabInteger are introduced (“pushed”) as a pseudo-observation into the Kalman float filter (or optionally a copy of it) to determine a rover position based on integer-nature ambiguities. The state vector of the float filter copy is thus:




  
    
      
        {
        
          
            
              
                X
                r
              
            
          
          
            
              
                Y
                r
              
            
          
          
            
              
                Z
                r
              
            
          
          
            
              
                dT
                c
              
            
          
          
            
              T
            
          
        
        }
      
    
    
      
        (
        124
        )
      
    
  




The rover position can then be determined with an accuracy (and precision) substantially better than for the typical prior-art PPP processing in which the ambiguities are considered to be float numbers, as shown in FIG. 42.
FIG. 43 shows a block diagram of a positioning scheme 4800 using ambiguity fixing in accordance with some embodiments of the invention. In this example, after satellite clock (clock and orbit) corrections 4802 and MW bias corrections 4804 are received, e.g., via a link such as communications satellite 4806, they are used along with GNSS data 4808 collected by the rover receiver 4810, e.g., from observations of GNSS satellites 4812, 4814, 4816. Processing is performed in two filters: a first filter 4818 with a geometric, ionospheric-free model (Part 12.5, Equations 107-108), and a second filter 4820 with a geometry- and ionospheric-free model (Part 12.6, Equation 116). From the first filter 4818 phase-leveled ionospheric-free ambiguities 4822 with corresponding covariance matrix 4824 are obtained. From the second filter 4820 integer wide-lane ambiguities 4826 are obtained. At 4828, single-differenced integer-nature float ambiguities 4830 are determined from the phase-leveled ionospheric-free ambiguities 4822 and the wide-lane ambiguities 4826. The single-differenced integer-nature float ambiguities 4830 are re-processed at 4832 using an integer-least-squares-based approach (to “fix” them as that term is defined herein to mean fixing as integers or forming weighted averages) to obtain single-differenced, integer-nature L1 ambiguities 4834. These ambiguities 4834 are then re-combined at 4836 with the integer nature wide-lane ambiguities 4826 to yield single-differenced integer-nature ionospheric-free ambiguities 4840. These ambiguities 4840 are then applied in a third filter 4842 which estimates rover receiver clock 4844, and satellite-rover ranges 4846 from which the receiver position is determined.
FIG. 44 shows a block diagram of a positioning scheme 4900 using ambiguity fixing in accordance with some embodiments of the invention. In this example, satellite clock corrections 4902 received, e.g., via a link such as communications satellite 4904, are used along with GNSS data 4906 collected by the rover receiver 4908, e.g., from observations of GNSS satellites 4910, 4912, 4814, in a first filter 4916. Filter 4916 estimates float values for carrier ambiguities 4918 with corresponding covariances 4920. At 4922, integer-nature carrier-phase ambiguities 4924 are determined using float ambiguities 4918 and the respective covariance matrix 4920 provided by first filter 4916. The integer-nature carrier-phase ambiguities 4924 and satellite clock corrections 4902 and GNSS data 4906 are used in a second filter 4926 to determine the receiver position 4928.
FIG. 45 shows a block diagram of a positioning scheme 5000 using ambiguity fixing in accordance with some embodiments of the invention. In this example, satellite clock corrections 5002 received, e.g., via a link such as communications satellite 5004, are used along with GNSS data 5006 collected by the rover receiver 5008, e.g., from observations of GNSS satellites 5010, 5012, 5014, in a first filter 5016. Filter 5016 estimates values for carrier ambiguities 5018 with corresponding covariances 5020. At 5022, integer-nature single-differenced carrier-phase ambiguities 5024 are determined using float ambiguities 5018 and the respective covariance matrix 5020 provided by first filter 5016. The integer-nature single-differenced carrier-phase ambiguities 5024 and satellite clock corrections 5002 and GNSS data 5006 are used in a second filter 5026 to determine the receiver position 5028.
FIG. 46 shows a block diagram of a positioning scheme 5100 using ambiguity fixing in accordance with some embodiments of the invention. In this example, satellite clock corrections 5102 and satellite MW biases 5104 received, e.g., via a link such as communications satellite 5106, are used along with GNSS data 5108 collected by the rover receiver 5110, e.g., from observations of GNSS satellites 5112, 5114, 5116 in a first filter 5118. Filter 5118 estimates values for carrier-phase ionospheric-free float ambiguities 5120 with corresponding covariances 5122. A third filter 5124 uses the satellite MW bias corrections 5104 and the GNSS data 5108 to determine wide-lane carrier ambiguities 5126. At 5128, integer-nature carrier-phase ambiguities 5130 are determined using the float iono-free ambiguities 5120 and the respective covariance matrix 5122 provided by first filter 5118 and the wide-lane carrier ambiguities 5126 provided by third filter 5124. A second filter 5132 uses the integer-nature carrier-phase ambiguities 5130 with the GNSS data 5108 and the satellite clock corrections 5102 to determine receiver position 5134.
FIG. 47 shows a block diagram of a positioning scheme 5200 using ambiguity fixing in accordance with some embodiments of the invention. In this variant of the example of FIG. 46, satellite clock corrections 5202 and satellite MW biases 5204 are received, e.g., via a link such as communications satellite 5206. Satellite clock corrections 5202 are used along with GNSS data 5208 collected by the rover receiver 5210, e.g., from observations of GNSS satellites 5212, 5214, 5216 in a first filter 5218. First filter 5218 estimates values for float ambiguities 5220 with corresponding covariances 5222. A third filter 5224 uses the satellite MW bias corrections 5204 and the GNSS data 5208 to determine wide-lane carrier ambiguities 5228. At 5228, integer-nature ambiguities 5230 are determined from the carrier ambiguities 5220, the carrier ambiguities covariances 5222 and the widelane carrier ambiguities 5226, using a covariance matrix which is scaled with a certain factor (see, e.g., Equation 120). A second filter 5232 uses the integer-nature carrier-phase ambiguities 5230 with the GNSS data 5208 and the satellite clock corrections 5202 to determine receiver position 5234.
FIG. 48 shows a block diagram of a positioning scheme 5300 using ambiguity fixing in accordance with some embodiments of the invention. In this variant of the examples of FIG. 46 and FIG. 47, satellite clock corrections 5302 and satellite MW biases 5304 are received, e.g., via a link such as communications satellite 5306. Satellite clock corrections 5302 are used along with GNSS data 5308 collected by the rover receiver 5310, e.g., from observations of GNSS satellites 5312, 5314, 5316 in a first filter 5318. First filter 5318 estimates values for float ambiguities 5320 with corresponding covariances 5322. A third filter 5324 uses the satellite MW bias corrections 5304 and the GNSS data 5308 to determine single-differenced-between-satellites wide-lane carrier ambiguities 5326. At 5328, single-differenced-between-satellites integer-nature carrier-phase ambiguities 5330 are determined from the carrier-phase ambiguities 5320, the carrier ambiguities covariances 5322 and the widelane carrier ambiguities 5326, using a covariance matrix which is scaled with a certain factor (see, e.g., Equation 120). A second filter 5232 uses the integer-nature carrier-phase ambiguities 5330 with the GNSS data 5308 and the satellite clock corrections 5302 to determine receiver position 5334.
FIG. 49 shows a block diagram of a positioning scheme 5400 using ambiguity fixing in accordance with some embodiments of the invention. In this variant, satellite clock corrections 5402 and satellite MW biases 5404 are received, e.g., via a link such as communications satellite 5406. Satellite clock corrections 5402 are used along with GNSS data 5408 collected by the rover receiver 5410, e.g., from observations of GNSS satellites 5412, 5414, 5416 in a first filter 5418. First filter 5418 estimates values for float ambiguities 5420 with corresponding covariances 5422. A third filter 5424 uses the satellite MW bias corrections 5404 and the GNSS data 5408 to determine wide-lane carrier ambiguities 5426. At 5428, integer-nature iono-free ambiguities 5430 of two carrier frequencies (e.g., L1 and L2) are determined from the carrier ambiguities 5420, the carrier ambiguities covariances 5422 and the widelane carrier ambiguities 5426, using a covariance matrix which is scaled with a certain factor (see, e.g., Equation 120). A second filter 5432 uses the integer-nature carrier-phase ambiguities 5430 with the GNSS data 5408 and the satellite clock corrections 5402 to determine receiver position 5434. The integer-nature carrier ambiguities 5430 can be sets of L1 and L2 ambiguities, or sets of L2 and L5 ambiguities, or sets of any linear combination of two or more GNSS frequencies.
FIG. 50 shows a block diagram of a positioning scheme 5500 using ambiguity fixing in accordance with some embodiments of the invention. In this variant, satellite clock corrections 5502 and ionospheric delay information 5504 and satellite MW biases 5506 are received, e.g., via a link such as communications satellite 5508. Satellite clock corrections 5502 and ionospheric delay information 5504 are used along with GNSS data 5510 collected by the rover receiver 5512, e.g., from observations of GNSS satellites 5514, 5516, 5518 in a first filter 5520. First filter 5520 estimates values for float ambiguities 5522 with corresponding covariances 5524. A third filter 5526 uses the satellite MW bias corrections 5506 and the GNSS data 5510 to determine wide-lane carrier ambiguities 5528. At 5530, integer-nature L1 ambiguities 5532 are determined from the carrier ambiguities 5522, the carrier ambiguities covariances 5524 and the widelane carrier ambiguities 5528, using a covariance matrix which is scaled with a certain factor (see, e.g., Equation 120). A second filter 5534 uses the integer-nature L1 carrier-phase ambiguities 5532 with the GNSS data 5510 and the satellite clock corrections 5502 and ionospheric delay information 5504 to determine receiver position 5536. In further variants of FIG. 50 the ionospheric delay information 5504 is used to feed one or more filters used in the data processing, and/or the determined integer-nature ambiguities 5532 used for determining the receiver position 5536 can be sets of L1 ambiguities or L2 ambiguities or L5 ambiguities, or sets of ambiguities of any GNSS frequency.
FIG. 51 is the same as FIG. 54, in which the second filter 5632 is an independent filter from the first filter 5418 and third filter 5424.
FIG. 52 shows a variation 5700 of the embodiment of FIG. 56 in which the second filter 5732 is a copy of the first filter 5418.
FIG. 53 shows a variation 5800 of the embodiments of FIG. 51 and FIG. 52, in which the second filter 5632 of FIGS. 51 and 5732 of FIG. 52 is replaced by the first filter 5418. This means that when the integer-nature ionospheric-free ambiguities 5430 are determined, they are fed back to the first filter 5418 which is then used to determine the receiver position 5434.
FIG. 54 is a detailed view of an embodiment of the first filter 5418, showing that the satellite clock corrections 5402 include code-leveled satellite clock corrections 5906 and phase-leveled satellite clock corrections 5908. The code-leveled satellite clock corrections 5906 are used at 5914 for modeling GNSS observations in an observation filter 5912. The resulting code-leveled float carrier ambiguities 5918 are adapted at 5920 to the level of the phase-leveled satellite clocks 5908 by applying the difference between the code-leveled satellite clock 5906 and the phase-leveled satellite clock 5908 to obtain phase-leveled carrier ambiguities 5420. Observation filter 5912 also provides covariances 5422 of the carrier ambiguities.
FIG. 55 is a detailed view of an embodiment of the first filter 5418 in which the code-leveled satellite clock corrections 5906 are used in an observation filter 6012 for modeling code observations at 6014. The phase-leveled satellite clock 5908 is used at 6016 for modeling carrier-phase observations. The resulting ambiguities from the observation filter 6012 are the phase-leveled carrier ambiguities 5420. The observation filter 6012 also provides covariances 5422 of the carrier ambiguities.
FIG. 56 shows a variant of previous FIGS. in which the integer-nature ambiguities are determined at 6128 using at least one of: rounding the float ambiguity to the nearest integer, choosing best integer candidates from a set of integer candidates generated using integer least squares, and computing float values using a set of integer candidates generated using integer least squares.
FIG. 57 shows a variant of previous FIGS. in which at least one of the first filter 5418 and the second filter 5432 further estimates values 6202, 6252, respectively including at least one of values for: receiver phase-leveled clock states 6204, 6254, receiver code-leveled clock states 6606, 6256, tropospheric delay states 6208, 6258, receiver clock bias states 6210, 6260 representing a difference per satellite between code-leveled receiver clock and phase-leveled receiver clock, and multipath states 6212, 6262.
Part 12.7 Ambiguity Fixing References
Some references relevant to ambiguity fixing include:

    Jonge de, P. J., and C. C. J. M. Tiberius (1994). A new GPS ambiguity estimation method based on integer least squares. Proceedings of the 3rd International Symposium on Differential Satellite Navigation Systems DSNS '94, London, UK, April 18-22, Paper No. 73, 9 pp.
    X.-W. Chang, X. Yang and T. Zhou (2005). MLAMBDA: a modified LAMBDA method for integer least-squares estimation. Journal of Geodesy, Springer Berlin/Heidelberg. Volume 79, Number 9/December, 2005, pp. 552-565.

Part 13: Summary of Some of the Inventive Concepts



Section 13A: MW (Melbourne-Wübbena) Bias Processing (A-2565)

    1. [MW Processing] A method of processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising:
    
        a. forming an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch, and
        b. estimating from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.
    
    
    2. The method of 1, further comprising applying corrections to the GNSS signal data.
    3. The method of one of 1-2, further comprising smoothing at least one linear combination of GNSS signal data before estimating an MW bias per satellite.
    4. The method of one of 1-3, further comprising applying at least one MW bias constraint.
    5. The method of one of 1-4, further comprising applying at least one integer WL ambiguity constraint
    6. The method of one of 1-4, further comprising using a spanning tree (ST) over one of an observation graph and a filter graph for constraining the WL ambiguities.
    7. The method of one of 1-4, further comprising using a minimum spanning tree (MST) on one of an observation graph and a filter graph for constraining the WL ambiguities.
    8. The method of 7, wherein the minimum spanning tree is based on edge weights, each edge weight derived from receiver-satellite geometry.
    9. The method of 8, wherein the edge weight is defined with respect to one of (i) a geometric distance from receiver to satellite, (ii) a satellite elevation angle, and (iii) a geometric distance from satellite to receiver to satellite, and (iv) a combination of the elevations under which the two satellites in a single differenced combination are seen at a station.
    10. The method of 7, wherein the minimum spanning tree is based on edge weights, with each edge weight based on WL ambiguity information, defined with respect to one of (i) difference of a WL ambiguity to integer, (ii) WL ambiguity variance, and (iii) a combination of (i) and (ii).
    11. The method of one of 1-10, further comprising fixing at least one of the WL ambiguities as an integer value.
    12. The method of one of 1-10, further comprising determining candidate sets of WL integer ambiguity values, forming a weighted combination of the candidate sets, and fixing at least one of the WL ambiguities as a value taken from the weighted combination.
    13. The method of one of 11-12, wherein the estimating step comprises introducing fixed WL ambiguities so as to estimate MW biases which are compatible with fixed WL ambiguities.
    14. The method of 13, wherein the estimating step comprises applying an iterative filter to the MW data per epoch and wherein introducing fixed WL ambiguities comprises one of (i) putting the fixed WL ambiguities as observations into the filter, (ii) putting the fixed WL ambiguities as observations into a copy of the filter generated after each of a plurality of observation updates, and (iii) reducing the MW combinations by the fixed WL ambiguities and putting the resulting reduced MW combinations into a second filter without ambiguity states to estimate at least one MW bias per satellite.
    15. The method of one of 1-14, further comprising shifting at least one MW bias by an integer number of WL cycles.
    16. The method of one of 1-14, further comprising shifting at least one MW bias and its respective WL ambiguity by an integer number of WL cycles.
    17. The method of one of 1-16, wherein the navigation message comprises orbit information,
    18. Apparatus adapted to perform the method of one of 1-17.
    19. A computer program comprising instructions configured, when executed on a computer processing unit, to carry out a method according to one of 1-17.
    20. A computer-readable medium comprising a computer program according to 19.


Section 13B: Orbit Processing (A-2647)

    1. A method of processing a set of GNSS signal data derived from signals of GNSS satellites observed at reference station receivers, the data representing code observations and carrier observations on each of at least two carriers over multiple epochs, comprising:
    
        a. obtaining an orbit start vector (2635) comprising: a time sequence of predicted positions and predicted velocities for each satellite over a first interval and the partial derivatives of the predicted positions and predicted velocities with respect to initial positions, initial velocities, force model parameters and Earth orientation parameters,
        b. obtaining ionospheric-free linear combinations (2645) of the code observations and the carrier observations for each satellite at multiple reference stations, and
        c. iteratively correcting the orbit start vector (2635) using at each epoch the ionospheric-free linear combinations (2645) and predicted Earth orientation parameters (2610), as soon as the ionospheric-free linear combinations of the epoch are available, to obtain updated orbit start vector values (2680) comprising a time sequence of predicted positions and predicted velocities for each satellite over a subsequent interval of epochs and an estimate of Earth orientation parameters.
    
    
    2. [Startup] The method of 1, wherein obtaining an orbit start vector (2635) comprises:
    
        i. obtaining an approximate orbit vector (2615) for the satellites,
        ii. obtaining predicted Earth orbit parameters (2610),
        iii. iteratively integrating the approximate orbit vector with the predicted Earth orbit parameters to obtain an orbit prediction (2620) for an initial time interval and, with each iteration, adapting the orbit prediction (2620) to the approximate orbit vector, and
        iv. preparing from the orbit prediction (2620) an initial set of values for the orbit start vector and partial derivatives (2635).
    
    
    3. The method of 2, wherein the approximate orbit vector (2615) is obtained from one of: a broadcast satellite navigation message, IGS Ultra-rapid Orbits data, and another source of predicted orbits.
    4. The method of one of 2-3, wherein adapting the orbit prediction (2620) to the approximate orbit vector (2615) is performed using a least squares approach.
    5. The method of one of 2-4, wherein integrating the approximate orbit vector (2615) with the predicted Earth orientation parameters (2610) to obtain an orbit prediction (2620) is iterated until the orbit prediction remains substantially constant.
    6. The method of 1, wherein obtaining an orbit start vector (2635) comprises preparing the orbit start vector (2635) from a set of the updated orbit start vector values (2680) which is not older than a predetermined time interval.
    7. The method of 6, wherein the predetermined time interval is not more than a few hours.
    8. [Operation] The method of one of 6-7, wherein preparing the orbit start vector (2635) comprises: mapping a new orbit start vector (2690) from the updated orbit start vector (2680) and integrating the new orbit start vector (2690) to obtain new values for the orbit start vector (2635).
    9. The method of 8, wherein integrating the new orbit start vector (2690) comprises integrating the new orbit start vector using Earth orientation parameters from the updated start vector values (2680).
    10. [Kalman] The method of one of 1-9, wherein correcting comprises applying an iterative filter comprising one of: a Kalman filter, a UD factorized filter, and a Square Root Information Filter.
    11. [Satellite parameters] The method of one of 1-10, wherein the updated orbit start vector (2680) further comprises additional parameters for each satellite, and wherein iteratively correcting the orbit start vector comprises correcting the additional parameters for each satellite.
    12. [Output] The method of one of 1-11, further comprising: mapping values from the updated orbit start vector 2680 to a current epoch to obtain a current-epoch orbit position and velocity for each satellite.
    13. [Fixing] The method of one of 1-6, wherein the orbit start vector further comprises an ionospheric-free ambiguity (2575) per receiver-satellite pair, wherein correcting the orbit start vector (2635) comprises estimating float values for the ionospheric-free ambiguities, and
    
        wherein the method further comprises:
        1. obtaining a value for a widelane ambiguity (340) per receiver-satellite pair, the widelane ambiguity values having integer nature,
        2. determining integer-nature values for ambiguities linearly related to the widelane ambiguities and the ionospheric-free ambiguities from the values of the widelane ambiguities and the float values of the ionospheric-free ambiguities,
        3. fixing the values of the ionospheric-free ambiguities using the integer-nature values, and
        4. with the values of the ionospheric-free ambiguities fixed, iteratively correcting the orbit start vector (2635) using a time sequence of the ionospheric-free linear combinations (2645) and a set of Earth orbit parameters to obtain an updated orbit start vector (2680) comprising a time sequence of predicted positions and predicted velocities for each satellite over an interval of multiple epochs and an estimate of Earth orientation parameters.
    
    
    14. The method of 13, wherein the ambiguities linearly related to the widelane ambiguities and the ionospheric-free ambiguities comprise one of: narrowlane ambiguities, L1 ambiguities and L2 ambiguities.
    15. [Epoch] The method of one of 1-14, wherein the epochs occur at a rate of about 1 Hz.
    16. [Filter Update] The method of one of 1-15, wherein iteratively correcting the orbit start vector comprises estimating for each epoch the values of a satellite clock for each satellite and a satellite position for each satellite at each epoch.
    17. [Filter Update] The method of one of 1-15, wherein iteratively correcting the orbit start vector comprises estimating for each epoch the values of a satellite clock for each satellite, a satellite clock drift, a satellite clock drift rate, and a satellite position for each satellite at each epoch.
    18. [Orbit Estimate] The method of one of 1-17, wherein the predicted time sequence of approximate positions for each satellite for at least some of the epochs covers an interval of at least 150 seconds.
    19. [Worldwide network] The method of one of 1-18, wherein the reference stations are widely distributed about the Earth and the GNSS signal data from each reference station represents code observations and carrier observations of a subset of the GNSS satellites at each epoch.
    20. Apparatus adapted to perform the method of one of 1-19.
    21. A computer program comprising instructions configured, when executed on a computer processing unit, to carry out a method according to one of 1-19.
    22. A computer-readable medium comprising a computer program according to 21.


Section 13C: Phase Clock Processing (A-2585)

    1. [Network Processing—Estimating Phase Clocks] A method of processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies and a navigation message containing orbit information, comprising:
    
        a. obtaining precise orbit information for each satellite,
        b. determining at least one set of ambiguities per receiver, each ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, and
        c. using at least the precise orbit information, the ambiguities and the GNSS signal data to estimate a phase-leveled clock per satellite.
    
    
    2. The method of 1, wherein determining ambiguities is performed at a first rate and wherein estimating a phase-leveled clock per satellite is performed at a second rate higher than the first rate.
    3. The method of one of 1-2, wherein estimating the phase-leveled clock per satellite comprises:
    
        i. using at least the precise orbit information, the ambiguities and the GNSS signal data to estimate a set of phase-leveled clocks per receiver, each phase-leveled clock corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link, and
        ii. using a plurality of the phase-leveled clocks to estimate one phase-leveled clock per satellite.
    
    
    4. The method of one of 1-3, wherein determining the ambiguities comprises using at least one phase-leveled clock per satellite previously estimated to estimate the ambiguities.
    5. The method of one of 1-4, further comprising obtaining at least one additional phase-leveled clock per satellite estimated from an external source, and wherein determining the ambiguities comprises using said at least one additional phase-leveled clock per satellite to estimate the ambiguities.
    6. The method of one of 1-5, further comprising
    
        1. determining at least one set of ambiguities per receiver for additional receivers, each ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link,
        2. after determining the ambiguities for the additional receivers, using at least the precise orbit information, the ambiguities for the additional receivers and the GNSS signal data to estimate the at least one additional phase-leveled clock per satellite
    
    
    7. The method of one of 1-6, wherein the at least two carrier frequencies comprise at least two of the GPS L1, GPS L2 and GPS L5 frequencies.
    8. The method of one of 1-7, wherein determining at least one set of ambiguities per receiver comprises at least one of: estimating float ambiguity values, estimating float ambiguity values and fixing the float ambiguity values to integer values, estimating float ambiguity values and forming at least one weighted average of integer value candidates, and constraining the ambiguity values in a sequential filter.
    9. The method of one of 1-8, wherein the ambiguities are undifferenced between satellites.
    10. The method of one of 1-8, wherein the ambiguities are single-differenced between satellites.
    11. Apparatus adapted to perform the method of one of 1-10.
    12. A computer program comprising instructions configured, when executed on a computer processing unit, to carry out a method according to one of 1-10.
    13. A computer-readable medium comprising a computer program according to 12.


Section 13D: Rover Processing with Synthesized Reference Station Data (A-2617) [Abstract (FIG. 34)]

    1. [SBS Processing] A method of determining position of a rover antenna, comprising:
    
        a. obtaining rover GNSS data derived from code observations and carrier phase observations of GNSS signals of multiple satellites over multiple epochs,
        b. obtaining precise satellite data for the satellites,
        c. determining a virtual base station location,
        d. generating epochs of synthesized base station data using at least the precise satellite data and the virtual base station location, and
        e. applying a differential process to at least the rover GNSS data and the synthesized base station data to determine at least rover antenna positions.
    
    
    2. [Low Latency] The method of 1, wherein generating epochs of synthesized base station data comprises generating an epoch of virtual base station data for each epoch of GNSS rover data.
    3. [High Accuracy] The method of 1, wherein obtaining precise satellite data comprises obtaining precise satellite data in sets, wherein generating epochs of synthesized base station data comprises generating an epoch of synthesized base station data for each set of precise satellite data, and wherein applying a differential process comprises matching each set of GNSS rover data with an epoch of synthesized base station data.
    4. [Virtual Base Station Location] The method of one of 1-3, wherein determining a virtual base station location comprises determining the virtual base station location from at least one of: an autonomously determined position of the rover antenna, a previously determined one of said rover antenna positions, a synthesized base station data generating module, an inertial navigation system, a mobile telephone tower location, and information provided by a user.
    5. The method of one of 1-4, further comprising updating the virtual base station location on the occurrence of at least one of: never, for each epoch of rover data, when the distance between an approximate rover antenna position and the virtual base station location exceeds a predetermined threshold, and for each update of the rover antenna positions.
    6. The method of one of 1-5, wherein each epoch of the synthesized base station data is generated for a corresponding virtual base station location.
    7. The method of one of 1-5, wherein determining the virtual base station location comprises selecting a virtual base station location close to a current approximate rover antenna position.
    8. The method of one of 1-7, wherein a new virtual base position is determined when one or more of the following criteria is met: each rover epoch, each nth rover epoch, after a time interval, after exceeding a distance between a current approximate rover position and a current virtual base station location.
    9. The method of one of 1-8, wherein the virtual base station location is generated for a specific GNSS time interval
    10. The method of one of 1-9, wherein applying a differential process to at least the rover GNSS data and the synthesized base station data to determine at least rover antenna positions comprises at least one of: aided inertial navigation (integrated inertial navigation and GNSS) processing, real-time kinematic (RTK) processing, irtk processing; differential GPS processing; float processing; triple differenced processing; post-processing and real-time processing.
    11. The method of one of 1-10, further comprising matching each epoch of the rover GNSS data with an epoch of synthesized base station data within a few milliseconds.
    12. The method of one of 1-11, wherein generating epochs of synthesized base station data comprises generating a set of synthesized base station observations for each of a plurality of discrete times, and wherein applying a differential process comprises processing each epoch of GNSS rover data with a set of synthesized base station observations for a discrete time which is within ten seconds of the epoch of the GNSS rover data being processed.
    13. Apparatus adapted to perform the method of one of 1-12.
    14. A computer program comprising instructions configured, when executed on a computer processing unit, to carry out a method according to one of 1-12.
    15. A computer-readable medium comprising a computer program according to 14.


Section 13E: Rover Processing with Ambiguity Fixing (A-2599) [Abstract (FIG. 44)]

    1. A method of processing a set of GNSS signal data derived from signals of a set of satellites having carriers observed at a rover antenna, wherein the data includes a carrier observation and a code observation of each carrier of each satellite, comprising:
    
        a. obtaining for each satellite clock corrections comprising at least two of: (i) a code-leveled satellite clock, (ii) a phase-leveled satellite clock, and (iii) a satellite clock bias representing a difference between a code-leveled satellite clock and a phase-leveled satellite clock,
        b. running a first filter which uses at least the GNSS signal data and the satellite clock corrections to estimate values for parameters comprising at least one carrier ambiguity for each satellite, and a covariance matrix of the carrier ambiguities,
        c. determining from each carrier ambiguity an integer-nature carrier ambiguity comprising one of: an integer value, and a combination of integer candidates,
        d. inserting the integer-nature carrier ambiguities as pseudo-observations into a second filter, and applying the second filter to the GNSS signal data and the satellite clock corrections to obtain estimated values for parameters comprising at least the position of the receiver.
    
    
    2. The method of 1, wherein the integer-nature carrier ambiguities are between-satellite single-differenced ambiguities.
    3. The method of one of 1-2, further comprising
    a. obtaining a set of MW corrections,
    b. running a third filter using the GNSS signal data and at least the MW corrections to obtain at least a set of WL ambiguities,
    c. using the set of WL ambiguities to obtain the integer-nature carrier ambiguity.
    4. The method of 3, wherein the WL ambiguities comprise at least one of: float values, integer values, and float values based on integer candidates.
    5. The method of 4, wherein the covariance matrix of the ambiguities is scaled to reflect the change due to the use of the WL ambiguities.
    6. The method of one of 1-5, wherein the WL ambiguities are between-satellite single-differenced ambiguities.
    7. The method of one of 1-6, wherein the integer-nature ambiguities comprise at least one of: L1-L2 ionospheric-free ambiguities, L2-L5 ionospheric-free ambiguities, and carrier ambiguities of a linear combination of two or more GNSS frequencies.
    8. The method of one of 1-6, wherein ionospheric delay information is used to feed one or more of the filters and wherein the integer-nature ambiguity comprises at least one of: carrier ambiguity of L1 frequency, carrier ambiguity of L2 frequency, carrier ambiguity of L5 frequency, and carrier ambiguity of any GNSS frequency.
    9. The method of one of 1-8, wherein the second filter comprises one of: a new filter, a copy of the first filter, and the first filter.
    10. The method of one of 1-9, wherein the code-leveled satellite clock is used for modeling all GNSS observations, and the float ambiguity is adapted to the level of the phase-leveled clock by applying the difference between the code-leveled satellite clock and the phase-leveled satellite clock.
    11. The method of one of 1-9, wherein the code-leveled satellite clock is used for modeling all GNSS code observations and the phase-leveled satellite clock is used for modeling all GNSS carrier observations.
    12. The method of one of 1-11, wherein determining the integer-nature carrier ambiguity from a float ambiguity comprises at least one of: rounding the float ambiguity to the nearest integer, choosing best integer candidates from a set of integer candidates generated using integer least squares, and computing float values using a set of integer candidates generated using integer least squares.
    13. The method of one of 1-12, wherein at least one of the first filter and second filter further estimates at least one of: receiver phase-leveled clock, receiver code-leveled clock, tropospheric delay, receiver clock bias representing a difference between the code-leveled receiver clock and the phase-leveled receiver clock, and multipath states.
    14. The method of one of 1-13, wherein at least one of the first filter, the second filter and the third filter is adapted to update the estimated values for each of a plurality of epochs of GNSS signal data.
    15. Apparatus adapted to perform the method of one of 1-14.
    16. A computer program comprising instructions configured, when executed on a computer processing unit, to carry out a method according to one of 1-14.
    17. A computer-readable medium comprising a computer program according to 16.


Any plurality of the above described aspects of the invention may be combined to form further aspects and embodiments, with the aim of providing additional benefits notably in terms of surveying efficiency and/or system usability.
Above-described methods, apparatuses and their embodiments may be integrated into a rover, a reference receiver or a network station, and/or the processing methods described can be carried out in a processor which is separate from and even remote from the receiver/s used to collect the observations (e.g., observation data collected by one or more receivers can be retrieved from storage for post-processing, or observations from multiple network reference stations can be transferred to a network processor for near-real-time processing to generate a correction data stream and/or virtual-reference-station messages which can be transmitted to one or more rovers). Therefore, the invention also relates to a rover, a reference receiver or a network station including any one of the above apparatuses.
In some embodiments, the receiver of the apparatus of any one of the above-described embodiments is separate from the filter and the processing element. Post-processing and network processing of the observations may notably be performed. That is, the constituent elements of the apparatus for processing of observations does not itself require a receiver. The receiver may be separate from and even owned/operated by a different person or entity than the entity which is performing the processing. For post-processing, the observations may be retrieved from a set of data which was previously collected and stored, and processed with reference-station data which was previously collected and stored; the processing is conducted for example in an office computer long after the data collection and is thus not real-time. For network processing, multiple reference-station receivers collect observations of the signals from multiple satellites, and this data is supplied to a network processor which may for example generate a correction data stream or which may for example generate a “virtual reference station” correction which is supplied to a rover so that the rover can perform differential processing. The data provided to the rover may be ambiguities determined in the network processor, which the rover may use to speed its position solution, or may be in the form of corrections which the rover applies to improve its position solution. The network is typically operated as a service to rover operators, while the network operator is typically a different entity than the rover operator.
Any of the above-described methods and their embodiments may be implemented by means of a computer program. The computer program may be loaded on an apparatus, a rover, a reference receiver or a network station as described above. Therefore, the invention also relates to a computer program, which, when carried out on an apparatus, a rover, a reference receiver or a network station as described above, carries out any one of the above above-described methods and their embodiments.
The invention also relates to a computer-readable medium or a computer-program product including the above-mentioned computer program. The computer-readable medium or computer-program product may for instance be a magnetic tape, an optical memory disk, a magnetic disk, a magneto-optical disk, a CD ROM, a DVD, a CD, a flash memory unit or the like, wherein the computer program is permanently or temporarily stored. The invention also relates to a computer-readable medium (or to a computer-program product) having computer-executable instructions for carrying out any one of the methods of the invention.
The invention also relates to a firmware update adapted to be installed on receivers already in the field, i.e. a computer program which is delivered to the field as a computer program product. This applies to each of the above-described methods and apparatuses.
GNSS receivers may include an antenna, configured to receive the signals at the frequencies broadcasted by the satellites, processor units, one or more accurate clocks (such as crystal oscillators), one or more computer processing units (CPU), one or more memory units (RAM, ROM, flash memory, or the like), and a display for displaying position information to a user.
Where the terms “receiver”, “filter” and “processing element” are used herein as units of an apparatus, no restriction is made regarding how distributed the constituent parts of a unit may be. That is, the constituent parts of a unit may be distributed in different software or hardware components or devices for bringing about the intended function. Furthermore, the units may be gathered together for performing their functions by means of a combined, single unit. For instance, the receiver, the filter and the processing element may be combined to form a single unit, to perform the combined functionalities of the units.
The above-mentioned units may be implemented using hardware, software, a combination of hardware and software, pre-programmed ASICs (application-specific integrated circuit), etc. A unit may include a computer processing unit (CPU), a storage unit, input/output (I/O) units, network connection units, etc.
Although the present invention has been described on the basis of detailed examples, the detailed examples only serve to provide the skilled person with a better understanding, and are not intended to limit the scope of the invention. The scope of the invention is much rather defined by the appended claims.

## Claims

1. A method of operating a processor having associated data storage and program code enabling the processor to process a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising:
operating the processor to form an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch, the MW data set per epoch including a plurality of MW combinations, each of the plurality of MW combinations formed between one of the multiple receivers and one of the multiple satellites, and
operating the processor to estimate from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link,
wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.

2. The method of claim 1, further comprising operating the processor to apply corrections to the GNSS signal data.

3. The method of claim 1, further comprising operating the processor to smooth at least one linear combination of GNSS signal data before estimating the MW bias per satellite.

4. The method of claim 1, further comprising operating the processor to apply at least one MW bias constraint to estimate the MW bias per satellite and the set of WL ambiguities.

5. The method of claim 1, further comprising operating the processor to apply at least one integer WL ambiguity constraint to estimate the MW bias per satellite and the set of WL ambiguities.

6. The method of claim 1, further comprising operating the processor to constrain the WL ambiguities, using a spanning tree (ST) over one of an observation graph and a filter graph.

7. The method of claim 1, further comprising operating the processor to constrain the WL ambiguities, using a minimum spanning tree (MST) on one of an observation graph and a filter graph.

8. The method of claim 7, wherein the minimum spanning tree is based on edge weights, each edge weight derived from receiver-satellite geometry.

9. The method of claim 8, wherein the edge weight is defined with respect to one of (i) a geometric distance from receiver to satellite, (ii) a satellite elevation angle, and (iii) a geometric distance from satellite to receiver to satellite, and (iv) a combination of the elevations under which the two satellites in a single differenced combination are seen at a station.

10. The method of claim 7, wherein the minimum spanning tree is based on edge weights, with each edge weight based on WL ambiguity information, defined with respect to one of (i) difference of a WL ambiguity to integer, (ii) WL ambiguity variance, and (iii) a combination of (i) and (ii).

11. The method of claim 1, further comprising fixing at least one of the WL ambiguities as an integer value to provide at least one fixed WL ambiguity.

12. The method of claim 1, further comprising operating the processor to determine a candidate set of WL integer ambiguity values using the set of WL ambiguities, form a weight for each WL integer ambiguity value in the candidate set, form a weighted combination by summing the weights, and fix at least one WL ambiguity using the weighted combination.

13. The method of claim 11, wherein operating the processor to estimate comprises using the at least one fixed WL ambiguity to estimate the MW bias per satellite.

14. The method of claim 13, wherein operating the processor to estimate comprises applying an iterative filter to the MW data set per epoch and wherein using the at least one fixed WL ambiguity comprises one of (i) putting the at least one fixed WL ambiguity as an observation into the iterative filter, (ii) putting the at least one fixed WL ambiguity as an observation into a copy of the iterative filter generated after each of a plurality of observation updates, and (iii) reducing a number of MW combinations in the MW data set per epoch by the at least one fixed WL ambiguity and putting the resulting reduced MW combinations into a second filter without ambiguity states to estimate at least one MW bias per satellite.

15. The method of claim 1, further comprising shifting at least one MW bias by an integer number of WL cycles.

16. The method of claim 1, further comprising shifting at least one MW bias and its respective WL ambiguity by an integer number of WL cycles.

17. The method of claim 1, wherein the navigation message comprises orbit information.

18. Apparatus for processing a set of GNSS signal data derived from code observations and carrier-phase observations at multiple receivers of GNSS signals of multiple satellites over multiple epochs, the GNSS signals having at least two carrier frequencies, comprising:
a combiner operative to form an MW (Melbourne-Wübbena) combination per receiver-satellite pairing at each epoch to obtain a MW data set per epoch, the MW data set per epoch including a plurality of MW combinations, each of the plurality of MW combinations formed between one of the multiple receivers and one of the multiple satellites, and
a processor operative to estimate from the MW data set per epoch an MW bias per satellite which may vary from epoch to epoch, and a set of WL (widelane) ambiguities, each WL ambiguity corresponding to one of a receiver-satellite link and a satellite-receiver-satellite link,
wherein the MW bias per satellite is modeled as one of (i) a single estimation parameter and (ii) an estimated offset plus harmonic variations with estimated amplitudes.

19. The apparatus of claim 18, further comprising a receiver operative to apply corrections to the GNSS signal data.

20. The apparatus of claim 18, further comprising a data corrector operative to smooth at least one linear combination of GNSS signal data before the MW bias per satellite is estimated.

21. The apparatus of claim 18, wherein the processor is operative to apply at least one MW bias constraint to estimate the MW bias per satellite and the set of WL ambiguities.

22. The apparatus of claim 18, wherein the processor is operative to apply at least one integer WL ambiguity constraint to estimate the MW bias per satellite and the set of WL ambiguities.

23. The apparatus of claim 18, wherein the processor is operative to use a spanning tree (ST) over one of an observation graph and a filter graph to constrain the WL ambiguities.

24. The apparatus of claim 18, wherein the processor is operative to use a minimum spanning tree (MST) on one of an observation graph and a filter graph to constrain the WL ambiguities.

25. The apparatus of claim 24, wherein the minimum spanning tree is based on edge weights, each edge weight derived from receiver-satellite geometry.

26. The apparatus of claim 25, wherein the edge weight is defined with respect to one of (i) a geometric distance from receiver to satellite, (ii) a satellite elevation angle, and (iii) a geometric distance from satellite to receiver to satellite, and (iv) a combination of the elevations under which the two satellites in a single differenced combination are seen at a station.

27. The apparatus of claim 24, wherein the minimum spanning tree is based on edge weights, with each edge weight based on WL ambiguity information, defined with respect to one of (i) difference of a WL ambiguity to integer, (ii) WL ambiguity variance, and (iii) a combination of (i) and (ii).

28. The apparatus of claim 18, further comprising an ambiguity fixer module operative to fix at least one of the WL ambiguities as an integer value to provide at least one fixed WL ambiguity.

29. The apparatus of claim 18, further comprising an ambiguity searcher module operative to determine a candidate set of WL integer ambiguity values using the set of WL ambiguities, and an ambiguity combiner module operative to form a weight for each WL integer ambiguity value in the candidate set, form a weighted combination by summing the weights, and fix at least one WL ambiguity using the weighted combination.

30. The apparatus of claim 28, wherein the processor is further operative to use the at least one fixed WL ambiguity to estimate the MW bias per satellite.

31. The apparatus of claim 30, wherein the processor is further operative to apply an iterative filter to the MW data set per epoch and to use the at least one fixed WL ambiguity as one of (i) an observation in the iterative filter, (ii) an observation in a copy of the iterative filter generated after each of a plurality of observation updates, and (iii) reduce a number of MW combinations in the MW data set per epoch by the at least one fixed WL ambiguity and put the resulting reduced MW combinations in a second filter without ambiguity states to estimate at least one MW bias per satellite.

32. The apparatus of claim 18, further comprising a bias shifter operative to shift at least one MW bias by an integer number of WL cycles.

33. The apparatus of claim 18, further comprising an internal shifter operative to shift at least one MW bias and its respective WL ambiguity by an integer number of WL cycles.

34. The apparatus of claim 18, wherein the navigation message comprises orbit information.

35. Computer-readable non-transitory storage medium embodying instructions configured, when executed on a computer processing unit, to carry out the method of claim 1.