Abstract:
For the reduction of the multipath error of received GNSS navigation signals, a sequential Bayesian estimation is used, with a movement model underlying this estimation, which model is particularly designed for dynamic channel situations. Sequential Monte Carlo methods are used to calculate the posterior probability density functions of the signal parameters. To facilitate an efficient integration in received signal tracking loops, the invention builds on complexity reduction concepts that have previously been used in maximum likelihood (ML) estimators. 
     Applicable with GNSS satellite navigation receivers, e.g. GPS and Galileo.

Description:
BACKGROUND OF THE INVENTION 
       [0001]    The invention is directed to a method for estimating hidden channel parameters, specifically the delay, the amplitude and the phase of a GNSS navigation signal received in a dynamic multipath environment, using a sequential estimation by means of a recursive Bayesian filtering which starts from the likelihood value of the measured channel output signal and updates the value using a state transition model. 
       DESCRIPTION OF RELATED ART 
       [0002]    For a continuous estimation of the propagation time and the phase of an incoming signal, which are both variable in time due to the movement of a satellite and a receiver, a navigation receiver usually uses a combination of two control loops supporting each other. The so-called phase-lock-loop (PLL) for the control of the carrier phase is used to guarantee coherence with the received signal and to allow for a representation in the baseband. 
         [0003]    The so-called delay-lock-loop (DLL) synchronizes the received baseband signal with a locally simulated reference signal by maximizing their cross-correlation. A constant tracking of the maximum for the maintenance of the synchronization is achieved by corresponding shiftings of the reference signal from which the propagation time of the signal from the satellite to the receiver can be determined. The receiver will then calculate its own position from the propagation times of the signals from at least four satellites. 
         [0004]    In practice, this combination of DLL and PLL proves to be a robust realization of an almost optimal propagation time estimation device when there is no multipath propagation of the signals. If, however, the received signal is formed by a superposition of individual paths, which mainly occurs due to the transmitted signal being reflected or diffracted from objects in the vicinity of the receiver, the DLL will provide an erroneous estimation, which has an immediate effect on the precision of the position result. Multipath propagations, i.e. the reception of additional signal replicas due to reflections, which introduce a deviation into the estimated value of the delay-lock-loop (DLL) of a conventional navigation receiver, thus represent a significant source of errors within GNSS systems. 
         [0005]    Of the known signal processing methods for reducing the multipath error, most are based on more or less immediate modifications of the conventional DLL, aiming at reducing the influence of the additional paths as much as possible, i.e. to suppress this influence, as it were. 
         [0006]    Besides the presumably most simple variant, the so-called “narrow correlator” [A. van Dierendonck, P. Fenton, T. Ford: “Theory and Performance of Narrow Correlator Spacing in a GPS Receiver” in Proceedings of the ION National Technical Meeting 1992, San Diego, Calif., USA, 1992], wide-spread use is also made, for example, of the, so-called “strobe correlator” [L. Garin, F. van Diggelen, J. Rousseau: “Strobe and Edge Correlator Multipath Mitigation for Code” in Proceedings of the ION GPS 1996, Kansas City, Mo., USA, 1996], the so-called “gated correlator” [G. MacGraw, M. Brasch: “GNSS Multipath Mitigation using Gated and High Resolution Correlator Concepts” in Proceedings of the ION National Technical Meeting 1999, San Diego, Calif., USA, 1999] and the so-called “pulse-aperture correlator” [J. Jones, P. Fenton, B. Smith: “Theory and Performance of the Pulse Aperture Correlator” in NovAtel Technical Report, NovAtel Inc., Calgary, Alberta, Canada, 2004]. When receiving new forms of signals, these known methods require a particular “tuning” to reduce the impact of multipath errors as much as possible. 
         [0007]    Another approach to the reduction of multipath errors is to include the additional paths in the formulation of the estimation problem and to solve the same by optimum methods of simplifications of such methods. Techniques for the estimation of multipath errors treat multipath errors, especially propagation time delays, amplitudes and phases of the paths, as something to be estimated from channel observations, so that their effects can be removed trivially at a later processing stage. 
         [0008]    The estimation techniques may be differentiated into static and dynamic solutions, depending on the underlying assumption regarding the channel dynamics. Exemplary for a static multipath estimation are such estimations that belong to the family of maximum likelihood (ML) estimators which often use various effective maximization strategies through the likelihood function. Examples thereof are known from: 
         [0009]    D. van Nee, J. Siereveld, P. Fenton, and B. Townsend: “The Multipath Estimating Delay Lock Loop: Approaching Theoretical Accuracy Limits” in Proceedings of the IEEE Position, Location and Navigation Symposium 1994, Las Vegas, Nev., USA, 1994; 
         [0010]    L. Weill: “Achieving Theoretical Accuracy Limits for Pseudo-ranging in the Presence of Multipath” in Proceedings of the ION GPS 1995, Palm Springs, Calif., USA, 1995; 
         [0011]    J. Selva Vera: “Complexity Reduction in the Parametric Estmation of Superimposed Signal Replicas” in Signal Processing, Elsevier Science, Vol. 84, Nr. 12, Seiten 2325-2343, 2004; and 
         [0012]    P. Fenton, J. Jones: “The Theory and Performance of Novatel Inc&#39;s Vision Correlator” in Proceedings of the ION GNSS 2005, Long Beach, Calif., USA, September 2005. 
         [0013]    The drawback of ML estimator techniques is that the parameters are presumed to be constant during the observation period. Independent estimated values are obtained for successive observation intervals whose duration has to be adapted to the dynamics of the channels. For static channels, for which no previous information is available, the ML solution is an optimum approach and works significantly better than other techniques, especially for echoes with short propagation times. 
         [0014]    An estimator for multipath situations that is based on sequential importance sampling (SIS) methods (particle filtering) and is considered in an article by P. Closas, C. Fernandez-Prades, J. Fernandez-Rubio, A. Ramirez-Gonzalez: “Multipath Mitigation using Particle Filtering” in Proceedings of the ION GNSS 2006, Fort Worth, Tex., USA, September 2006, is advantageous in that it allows the additional use of a-priori knowledge about the channel properties. Further, the instantaneous solution and its covariance matrix are used to estimate the subsequent point in time, whereby the time-related correlation of the estimation parameters is taken into account. 
         [0015]    While all these known estimation methods are based on the same concept, they differ in the details of the manner in which they strive to realize the solution as effectively as possible. In effect, an immediate implementation will fail due to the unrealistically high complexity. With static channels, the ML estimator is optimal and obtains clearly better results than other methods, especially when the additional paths only show slight relative delays. 
         [0016]    One possible way to combine the knowledge about the temporal correlation of the estimation parameters with the methods for an efficient implementation of an ML estimator, proposed in the above mentioned article by J. Selva Vera, is presented in an article by B. Krach, M. Lentmaier: “Efficient Soft-Output GNSS Signal Parameter Estimation using Signal Compression Techniques” in Proceedings of the 3rd ESA Workshop on Satellite Navigation User Equipment Technologies, Navitec 2006, Noordwijk, The Netherlands, December 2006. 
         [0017]    The knowledge about the parameter development may be provided, for example, by the DLL/PLL loop of a conventional receiver. The method allows to calculate the a-posteriori distribution of the estimation parameters whose maximum can be determined, for example, with the methods stated in the above mentioned article by J. Selva Vera. 
         [0018]    All presently existing methods are suboptimal and/or not adapted to the dynamic properties of the channels. In environments that are critical with respect to multipath propagation, such as in urban canyons in cities, the navigation receivers currently known do not work reliably. 
         [0019]    When implementing a maximum likelihood (ML) estimation method, the number of paths is presumed to be known. In practice, this number has to be estimated or assumed, however, whereby the performance of these methods can be much impaired by erroneous assumptions or erroneous estimations of this parameter. 
       SUMMARY OF THE INVENTION 
       [0020]    It is an object of the present invention to provide an advantageous solution with reduced complexity, with which multipath errors can be eliminated in an optimal manner in GNSS navigation receivers not only in static channel situations, but also in dynamic channel situations, whereby the reliability of such receivers is significantly increased and, above all, the determination of geographic positions is effected much more precisely. 
         [0021]    According to the invention, which refers to a method of the type mentioned initially, this object is solved by using previous knowledge about the statistical dependencies between two successive sets of the time-varying channel parameters, introducing therein a movement model approximated to the actual channel environment, which model corresponds to a Markov process and forms the state transition model, wherein the knowledge that reflection signals typically have a life cycle starting from their first appearance and then experience a gradual change in their delay, amplitude and phase over time until they disappear, is used for an a-posteriori prediction, and, on the basis of this movement model, by sequentially estimating the channel parameters using the recursive Bayesian filtering, wherein the number of paths is implicitly estimated as well, the result of this estimation not only being a fixed estimated value, but a-posteriori probability density functions of the estimated channel parameters. 
         [0022]    A description as a sequential Bayesian estimation problem allows to formulate an optimum solution approach for dynamic multipath channels. For the important practical case of dynamic channel situations, the present invention provides a solution to the problem of how to improve the estimation of propagation time when information about the development of the channel parameters over time is available. The solution proposed by the invention is based on Bayesian filtering, the optimum and well known framework for mastering such problems of dynamic state estimation. 
         [0023]    Sequential Monte Carlo (SMC) methods are used appropriately in the practical implementation for calculating the a-posteriori probability density functions (PDFS) of the signal parameters. 
         [0024]    An efficient and advantageous implementation of the sequential Monte Carlo method for calculating the a-posteriori probability density functions is possible with the use of “sequential importance sampling” (SIS) methods (“particle filter”), especially with the use of “sampling importance resampling particle filtering” SIR-PF. 
         [0025]    Possible applications for the method operating according to the present invention, primarily exist in modern satellite navigation receivers, especially such receivers that are to allow navigation in difficult environments with strong, time-varying multipath propagation. 
         [0026]    Furthermore, providing reliability information in the form of a-posteriori probabilities is of interest in certain so-called safety of life (SOL) applications. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0027]    The following is a detailed description of the invention with reference to the accompanying drawings. In the Figures: 
           [0028]      FIG. 1  is a block diagram of the hidden Markov estimation process for three times, the channel measurements being represented by the sequence z i , i=1, . . . , k, and the channel parameters are x i , i=1, . . . ,k, 
           [0029]      FIG. 2  is another block diagram of the recursive Bayesian estimation filter, 
           [0030]      FIG. 3  an illustration of the Markov process selected in the following description for modelling a channel with N m  paths, the dotted arrows illustrated only in a small partial set of the transitions indicating the secondary condition Δτ i,k ≧0, 
           [0031]      FIG. 4  is a block diagram of an embodiment of an integration of the method of the invention into a conventional GNSS navigation receiver, 
           [0032]      FIG. 5  is a diagram illustrating the simulation result for a multipath situation considered, the pseudo ranges (=propagation time multiplied by speed of light) [m] being represented as a function of time [s] in the direct path (line of sight) as a continuous line and temporarily existing echoes (multipaths) being shown as short lines, and 
           [0033]      FIG. 6  illustrates, in a diagram of the distance measurement error [m] as a function of time [s] obtained by simulation, the performance of the sequential estimation process with particle filtering (lower line) according to the present invention compared with the result of a estimation using a conventional DLL with a “narrow correlator” (upper line). 
       
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
       [0034]    First, the underlying signal model will be explained. 
         [0035]    Let it be assumed that the complex-valued, baseband-equivalent received signal equals 
         [0000]    
       
         
           
             
               
                 
                   
                     z 
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         1 
                       
                       
                         N 
                         m 
                       
                     
                      
                     
                       
                         
                           
                             e 
                             i 
                           
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                         · 
                         
                           
                             a 
                             i 
                           
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                         · 
                         
                           c 
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                       
                       * 
                       
                         g 
                          
                         
                           ( 
                           
                             t 
                             - 
                             
                               
                                 τ 
                                 i 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                             + 
                             
                               n 
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0036]    where c(t) is a delta-train code sequence modulated to a pulse g(t). N m  is the total number of paths allowed that reach the receiver (so as to restrict the modeling complexity), e i (t) is a binary function controlling the activity of the i-th path and a i (t) as well as τ i (t) are their individual complex amplitudes or time delays, respectively. Additional white Gaussian noise n(t) interferes with the signal. 
         [0037]    If blocks of L samplings at the times (m+kL) T s , m=0, . . . ,L−1 are grouped as vectors z k , k=0, . . . , wherein the parameter functions e i (t), a i (t) and τ i (t) are assumed to be constant within the corresponding period and equal to e i,k (t), a i,k (t) and τ i,k (t), this can be rewritten as 
         [0000]    
       
         
           
             
               
                 
                   
                     z 
                     k 
                   
                   = 
                   
                     
                       
                         
                           CG 
                            
                           
                             ( 
                             
                               τ 
                               k 
                             
                             ) 
                           
                         
                          
                         
                           E 
                           k 
                         
                          
                         
                           a 
                           k 
                         
                       
                       
                          
                         
                           s 
                           k 
                         
                       
                     
                     + 
                     
                       
                         n 
                         k 
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0038]    In the compact form of the right side of equation (2), the samplings of the delayed pulses g(τ i,k ) are stacked as columns of the matrix G(τ k )=[g (τ i,k ), . . . ,g(τ Nn,k )], where C is a matrix representing the convolution with the code and the propagation times and amplitudes are comprised in the vectors τ k =[τ 1,k , . . . , τ N     m     ,k ] and a k =[a 1,k , . . . ,a N     m     ,k ]. Moreover, E k =diag[e k ] is used in short notation, where the elements of the vector e k =e k =[e 1,k , . . . ,e N     m     ,k ] T ,e i,k ε0,1 determine whether the i-th path is active or not, by either e i,k =1, corresponding to an active path, or e i,k =0, corresponding to a path not active at the moment. The term s k  refers to the signal hypothesis and is entirely determined by the channel parameters τ k , a k  and e k . Using equation (2), the associated likelihood function can be written as: 
         [0000]    
       
         
           
             
               
                 
                   
                     p 
                      
                     
                       ( 
                       
                         
                           z 
                           k 
                         
                          
                         
                           s 
                           k 
                         
                       
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       
                         
                           
                             ( 
                             
                               2 
                                
                               
                                   
                               
                                
                               π 
                             
                             ) 
                           
                           L 
                         
                          
                         
                           σ 
                           
                             2 
                              
                             
                                 
                             
                              
                             L 
                           
                         
                       
                     
                     · 
                     
                       
                         exp 
                          
                         
                           [ 
                           
                             
                               - 
                               
                                 1 
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   
                                     σ 
                                     2 
                                   
                                 
                               
                             
                              
                             
                               
                                 ( 
                                 
                                   
                                     z 
                                     k 
                                   
                                   - 
                                   
                                     s 
                                     k 
                                   
                                 
                                 ) 
                               
                               H 
                             
                              
                             
                               ( 
                               
                                 
                                   z 
                                   k 
                                 
                                 - 
                                 
                                   s 
                                   k 
                                 
                               
                               ) 
                             
                           
                           ] 
                         
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0039]    The likelihood function is of central importance for the algorithms discussed herein; its purpose is the quantification of the conditional probability of the received signal determined by the unknown signal, specifically the channel parameters. 
         [0040]    A reduction of the complexity can be obtained by data compression, interpolation and elimination of amplitudes. 
         [0041]    In the PH.D. dissertation “Efficient Multipath Mitigation in Navigation Systems” y J. Selva Vera, Universidad Politécnica de Catalunya, February 2004, a general concept for an efficient representation of the likelihood of equation (3) was presented that is applicable to may existing ML multipath error reduction methods. The basic idea of this concept is to formulate the equation (3) by a vector z c,k  that results from an orthogonal projection of the observed signal z k  to a smaller vector space, so that z c,k  is a sufficient statistic value according to the Neymann-Fisher factorization and is thus suitable for estimating s k . 
         [0042]    In other words: the reduced signal includes the same information as the original signal itself. In practice, this concept becomes relevant, since the projection can be achieved by processing the received signal of equation (2) by means of a correlator bank and a subsequent decorrelation of the correlator output signals. A variant of this very general concept has also been referred to as a signal compression theorem for a set of special projections, which, due to the structure of the correlators used, do not require the decorrelation step. 
         [0043]    Different from the correlation technique used in the above mentioned article by D. van Nee, J. Siereveld, P. Fenton, B. Townsend, the technique proposed in the article by P. Fenton, J. Jones, also mentioned before, for example already projects to an orthogonal and thus uncorrelated sub-space, similar to the code-adjusted correlator technique proposed in the above mentioned dissertation document. For reasons of complexity, all practically relevant embodiments of ML estimators operate in a projected space, namely after correlation. The corresponding mathematical background will be discussed farther below, including the interpolation of the likelihood and the elimination of complex amplitudes as further methods for a reduction of complexity. 
         [0044]    First, data compression for the reduction of complexity will be discussed. As explained above, the large vector, which includes the samplings z k  of the received signal, is linearly transformed to a vector z c,k  of much smaller size. Following this solution, the likelihood of equation (2) may be written in another form as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 z 
                                 k 
                               
                                
                               
                                 s 
                                 k 
                               
                             
                             ) 
                           
                         
                         = 
                           
                          
                         
                           
                             1 
                             
                               
                                 
                                   ( 
                                   
                                     2 
                                      
                                     
                                         
                                     
                                      
                                     π 
                                   
                                   ) 
                                 
                                 L 
                               
                                
                               
                                 σ 
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   L 
                                 
                               
                             
                           
                            
                           
                             
                               exp 
                                
                               
                                 [ 
                                 
                                   - 
                                   
                                     
                                       
                                         z 
                                         k 
                                         H 
                                       
                                        
                                       
                                         z 
                                         k 
                                       
                                     
                                     
                                       2 
                                        
                                       
                                           
                                       
                                        
                                       
                                         σ 
                                         2 
                                       
                                     
                                   
                                 
                                 ] 
                               
                             
                             · 
                           
                         
                       
                     
                   
                   
                     
                       
                           
                          
                         
                           exp 
                            
                           
                             [ 
                             
                               
                                 
                                    
                                   
                                     { 
                                     
                                       
                                         z 
                                         k 
                                         H 
                                       
                                        
                                       
                                         Q 
                                         c 
                                       
                                        
                                       
                                         Q 
                                         c 
                                         H 
                                       
                                        
                                       
                                         s 
                                         k 
                                       
                                     
                                     } 
                                   
                                 
                                 
                                   σ 
                                   2 
                                 
                               
                               - 
                               
                                 
                                   
                                     s 
                                     k 
                                     H 
                                   
                                    
                                   
                                     Q 
                                     c 
                                   
                                    
                                   
                                     Q 
                                     c 
                                     H 
                                   
                                    
                                   
                                     s 
                                     k 
                                   
                                 
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   
                                     σ 
                                     2 
                                   
                                 
                               
                             
                             ] 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             1 
                             
                               
                                 
                                   ( 
                                   
                                     2 
                                      
                                     
                                         
                                     
                                      
                                     π 
                                   
                                   ) 
                                 
                                 L 
                               
                                
                               
                                 σ 
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   L 
                                 
                               
                             
                           
                            
                           
                             
                               exp 
                                
                               
                                 [ 
                                 
                                   - 
                                   
                                     
                                       
                                         z 
                                         k 
                                         H 
                                       
                                        
                                       
                                         z 
                                         k 
                                       
                                     
                                     
                                       2 
                                        
                                       
                                           
                                       
                                        
                                       
                                         σ 
                                         2 
                                       
                                     
                                   
                                 
                                 ] 
                               
                             
                             · 
                           
                         
                       
                     
                   
                   
                     
                       
                           
                          
                         
                           exp 
                            
                           
                             [ 
                             
                               
                                 
                                    
                                   
                                     { 
                                     
                                       
                                         z 
                                         
                                           c 
                                           , 
                                           k 
                                         
                                         H 
                                       
                                        
                                       
                                         s 
                                         
                                           c 
                                           , 
                                           k 
                                         
                                       
                                     
                                     } 
                                   
                                 
                                 
                                   σ 
                                   2 
                                 
                               
                               - 
                               
                                 
                                   
                                     s 
                                     
                                       c 
                                       , 
                                       k 
                                     
                                     H 
                                   
                                    
                                   
                                     s 
                                     
                                       c 
                                       , 
                                       k 
                                     
                                   
                                 
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   
                                     σ 
                                     2 
                                   
                                 
                               
                             
                             ] 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0045]    with the compressed reception vector z c,k  and the compressed signal hypothesis s c,k : 
         [0000]        z   c,k   =Q   c   M   z   k   , s   c,k   =Q   c   H   s   k    (5) 
         [0046]    and the orthonormal compression matrix Q c  that has to fulfill 
         [0000]      Q c Q c   H ≈I, Q c   H Q c ≈I   (6) 
         [0047]    in order to minimize the compression loss. According to the above mentioned dissertation document, the compression may be double, so that 
         [0000]      Q c =Q cc Q pc    (7) 
         [0048]    can be factorized to a canonic component decomposition Q cc  and a principal component decomposition Q pc . In the above mentioned dissertation document, two possible choices are proposed for Q cc , namely 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     cc 
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               CG 
                                
                               
                                 ( 
                                 
                                   τ 
                                   b 
                                 
                                 ) 
                               
                             
                              
                             
                               R 
                               cc 
                               
                                 - 
                                 1 
                               
                             
                              
                             
                                 
                             
                              
                             signal 
                              
                             
                               - 
                             
                              
                             adjusted 
                           
                         
                       
                       
                         
                           
                             
                               C 
                                
                               
                                 ( 
                                 
                                   τ 
                                   b 
                                 
                                 ) 
                               
                             
                              
                             
                               R 
                               cc 
                               
                                 - 
                                 1 
                               
                             
                              
                             
                                 
                             
                              
                             code 
                              
                             
                               - 
                             
                              
                             adjusted 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0049]    where the elements of the vector τ b  define the positions of the individual correlations. For a decorrelation of the correlator output signals, as mentioned above, the whitening matrix R cc  may be obtained from a QR decomposition of CG (τ b ) or C(τ b ). Apart from operational conditions, both correlation methods indicated by equation (8) are equivalent from a conceptual point of view. As far as details regarding the compression by Q pc , reference is made to the above mentioned dissertation document. 
         [0050]    Hereinafter, the interpolation performed in connection with the reduction of the complexity will be discussed. In order to calculate equation (4) irrespective of the sampling grid, interpolation methods may be employed to an advantage. When using the discrete Fourier transformation (DFT), where Ψ is the DFT matrix and Ψ −1  is its inverted counterpart (IDFT), 
         [0000]    
       
         
           
             
               
                 
                   
                     s 
                     
                       c 
                       , 
                       k 
                     
                   
                   = 
                   
                     
                       
                         
                           Q 
                           c 
                           H 
                         
                          
                         C 
                          
                         
                             
                         
                          
                         
                           Ψ 
                           
                             - 
                             1 
                           
                         
                          
                         
                           diag 
                            
                           
                             [ 
                             
                               Ψ 
                                
                               
                                   
                               
                                
                               
                                 g 
                                  
                                 
                                   ( 
                                   0 
                                   ) 
                                 
                               
                             
                             ] 
                           
                         
                       
                       
                          
                         
                           
                             M 
                             
                               s 
                               c 
                             
                           
                           = 
                           
                             const 
                             . 
                           
                         
                       
                     
                      
                     
                       Ω 
                        
                       
                         ( 
                         
                           τ 
                           k 
                         
                         ) 
                       
                     
                      
                     
                       E 
                       k 
                     
                      
                     
                       a 
                       k 
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0051]    will be obtained, where Ω(τ k ) being a matrix of stacked vectors of a Vandermonde structure. 
         [0052]    Finally, in the context of the reduction of complexity, amplitude elimination shall also be discussed herein. In a further step, the number of parameters is reduced by optimizing the equation (4) for a given set of τ k  and e k  with respect to the complex amplitudes a k , which may be achieved through a solution of a closed form. By using 
         [0000]      S c,k   =M   S     c   Ω(τ k ) E   k   (10) 
         [0053]    and obtaining S c,k   +  removing the zero columns from S c,k , the corresponding amplitude values of the active paths are obtained: 
         [0000]        â   k   + =( S   c,k   +H   S   c,k   + ) −1   S   c,k   +H     z     c,k .  (11) 
         [0054]    Since a potential source of loss in performance has been introduced by the elimination of the amplitudes and their correlation in time is thus practically not considered, it is proposed to optimize equation (4) by using 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       z 
                       _ 
                     
                     
                       c 
                       , 
                       k 
                     
                   
                   = 
                   
                     
                       1 
                       Q 
                     
                     · 
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           0 
                         
                         
                           Q 
                           - 
                           1 
                         
                       
                        
                       
                         z 
                         
                           c 
                           , 
                           
                             k 
                             - 
                             1 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
         [0055]    with the adjustable observation coefficient Q. When equation (4) is evaluated, 
         [0000]        s   c,k   =S   c,k   â   k    (13) 
         [0056]    is used, where the elements of the vector â k  that indicate an active path (a k,i : i→e k,i =1) are set to the corresponding elements of â k   + . All other elements (a k,i : i→e k,i =0) may be set optionally, since their influence is masked by the zero elements of e k . 
         [0057]    The maximum likelihood (ML) concept will be discussed hereinafter in the context of the underlying signal model. 
         [0058]    The concept of ML multipath estimation has given rise to substantial research interest ever since the first solution has been proposed in the above mentioned article by D. van Nee, J. Siereveld, P. Fenton, B. Townsend. Despite different approaches in different publications, the goal is the same for all ML solutions, namely to find the signal parameters that maximize equation (3) for a given observation z k : 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       s 
                       ^ 
                     
                     k 
                   
                   = 
                   
                     arg 
                      
                     
                       
                         max 
                         
                           s 
                           k 
                         
                       
                        
                       
                         
                           { 
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   z 
                                   k 
                                 
                                  
                                 
                                   s 
                                   k 
                                 
                               
                               ) 
                             
                           
                           } 
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   14 
                   ) 
                 
               
             
           
         
       
     
         [0059]    Therefore, the signal parameters are assumed to be constant over the observation period k. There are different maximizing strategies that characterize the different solutions principally. Although substantial advantages in the theoretical analysis are offered, the practical advantage of the actual ML concept is doubtable due to a number of serious drawbacks:
       The ML estimator requires the channel to be static for the observation period, and it is not capable of making use of its correlation in time over the sequence k=1, . . . . Measured channel situations have shown a significant correlation in time.   Although of great interest in practice, the estimation of the number of reception channels often is not addressed. The decisive problem in this respect is to estimate the current number of paths correctly, so as to avoid a redundant determination, since a redundantly determined estimator tends to use the additional degrees of freedom for an adjustment of noise by introducing wrong paths. Various complex heuristics based on a selection of models are used to estimate the number of paths, by they suffer from the problem that the decision thresholds have to be adjusted dynamically. Typically, only a single hypothesis is followed which, in practice, causes the propagation of an error event.   The ML estimator only provides the most probable set of parameters for the given observation. No reliability information about the estimated values is included. As a consequence, ambiguities and multimodes of the likelihood are not preserved by the estimator.       
 
         [0063]    In practice, the following has to be taken into account during an ML execution. ML estimators require the parameters estimated to remain constant during the observation period. Due to data modulation and phase changes, this period, often referred to as the coherent integration time, is limited in practice to a span 1 ms to 20 ms. 
         [0064]    In order to obtain a sufficient noise performance with an ML estimator, it is necessary to expand its observation interval to about the equivalent adjustment time of a conventional tracing loop that usually is on the order of several hundred coherent integration periods. To eliminate these problems, the observations must become quasi coherent by supporting the ML estimator with a phase lock loop (PLL) and a data removal mechanism. 
         [0065]    The following is an explanation of the sequential estimation used in the method of the present invention. 
         [0066]    First, the optimum solution will be discussed. 
         [0067]    In the preceding part of the description, the signal models of the underlying time-varying processes have been established. The problem of multipath error reduction now becomes a problem of a sequential estimation of a hidden Markov process: The unknown channel parameters are to be estimated on the basis of a building sequence of received noisy channel output signals z k . 
         [0068]    The channel process for each coverage range of a satellite navigation system may be modeled as a Markov process of the first order, if future channel parameters—with the present state of the channel being known—only depend on the present state of the channel (and not on any past states). It is further assumed that the noise influencing the sequential channel output signals is independent of the past noise values. Thus, each channel observation only depends on the present channel state. As is known, Markov processes of higher order can be transformed into such processes of the first order. 
         [0069]    By intuition, not only the channel observation is used, to estimate the hidden channel parameters (through the likelihood function), but previous knowledge about the statistical dependencies between subsequent sets of channel parameters are used as well. It is known from channel measurements that channel parameters are time-varying, but not independently from one point in time to the next; usually an echo signal has a “life cycle” from its first appearance, followed by a more or less gradual change in its delay and phase over time, until it disappears. 
         [0070]    After the principal assumptions have been made, the concept of the sequential Bayesian estimation may now be applied. The entire history of observations (through the time index k) may be written as 
         [0000]      z k {circumflex over (=)}{z i , i=1, . . . , k}.   (15) 
         [0071]    Similarly, the sequence of parameters of the hidden Markov process is described by: 
         [0000]      x k {circumflex over (=)}{x i , i=1, . . . , k}.   (16) 
         [0072]    Thus, x i  represents the characterization of the hidden channel state including the parameters that specify the signal hypothesis s i  given in equation (2). It is the objective to determine the posterior probability density function (PDF) of every possible channel characterization, wherein all channel observations are given: p(x k |Z k ) (see  FIG. 1 ). 
         [0073]    Once the posterior probability density function (PDF) is evaluated, one may either determine the channel configuration that maximizes the function—the so-called maximum a-posteriori (MAP) estimated value—or one may choose an expectation—equivalent to the estimated value of the minimum mean square error (MMSE). In addition, the posterior distribution itself includes the entire incertitude about the current range and is thus the optimum measure to perform a sensor data fusion in an entire position detection system. 
         [0074]    It can be shown that the sequential estimation algorithm is recursive, since it uses the posterior probability density function (PDF) calculated for the time k-1 for the calculation of the posterior probability density function (PDF) for the time k (see  FIG. 2 ). For a given posterior probability density function (PDF) p(x k−1 |Z k−1 ) at the time k−1, the prior probability density function p(x k |Z k− 1) is calculated in the so-called prediction step by applying the Chapman-Komogorov equation: 
         [0000]        p ( x   k   |Z   k−1 )=∫ p ( x   k   |x   k−1 ) p ( x   k−1   |Z   k−1 ) d x   k−1    (17) 
         [0075]    where p(x k |x k− 1) is the state transition probability density function (PDF) of the Markov process. In the update step, the new posterior probability density function (PDF) for the step k is obtained by application of the Bayesian theorem on p(x|z k ,Z k−1 ), the normalized product being obtained from the likelihood p(x k |z k ) and the prior probability density function (PDF): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 x 
                                 k 
                               
                                
                               
                                 Z 
                                 k 
                               
                             
                             ) 
                           
                         
                         = 
                           
                          
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 
                                   x 
                                   k 
                                 
                                  
                                 
                                   z 
                                   k 
                                 
                               
                               , 
                               
                                 Z 
                                 
                                   k 
                                   - 
                                   1 
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               p 
                                
                               
                                 ( 
                                 
                                   
                                     
                                       z 
                                       k 
                                     
                                      
                                     
                                       x 
                                       k 
                                     
                                   
                                   , 
                                   
                                     Z 
                                     
                                       k 
                                       - 
                                       1 
                                     
                                   
                                 
                                 ) 
                               
                             
                              
                             
                               p 
                                
                               
                                 ( 
                                 
                                   
                                     x 
                                     k 
                                   
                                    
                                   
                                     Z 
                                     
                                       k 
                                       - 
                                       1 
                                     
                                   
                                 
                                 ) 
                               
                             
                           
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   z 
                                   k 
                                 
                                  
                                 
                                   Z 
                                   
                                     k 
                                     - 
                                     1 
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               p 
                                
                               
                                 ( 
                                 
                                   
                                     z 
                                     k 
                                   
                                    
                                   
                                     x 
                                     k 
                                   
                                 
                                 ) 
                               
                             
                              
                             
                               p 
                                
                               
                                 ( 
                                 
                                   
                                     x 
                                     k 
                                   
                                    
                                   
                                     Z 
                                     
                                       k 
                                       - 
                                       1 
                                     
                                   
                                 
                                 ) 
                               
                             
                           
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   z 
                                   k 
                                 
                                  
                                 
                                   Z 
                                   
                                     k 
                                     - 
                                     1 
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   18 
                   ) 
                 
               
             
           
         
       
     
         [0076]    The expression p(z k |x k )=p(z k |s c,k ) follows from equation (4) and represents the probability of the measured channel output signal (often referred to as the likelihood value), determined by a certain configuration of channel parameters at the same time-interval k. The denominator of equation (18) does not depend on x k  and can thus be calculated by integrating the denominator of equation (18) over the entire range of x k  (normalization). 
         [0077]    Summarized this far, the entire prediction and update process may be performed recursively in order to sequentially calculate the posterior probability density function (PDF) of equation (18) on the basis of an initial value of p(x 0 |z 0 )=p(x 0 ). 
         [0078]    The evaluation of the likelihood function p(z k |x k ) is the essential part of the update step. Likewise, maximizing this likelihood function (i.e. ML estimation) is equivalent to a maximization of p(x k |Z k ) only in the event that the prior probability density function p(x k |Z k−1 ) does not depend on Z k−1  and if all values of x k  a-priori have the same probability. Since these conditions are not met, the evaluation of p(x k |Z k ) entails all the previous steps. 
         [0079]    The following will discuss the sequential estimation with the use of particle filters. 
         [0080]    The optimum estimation algorithms are based on the evaluation of the integral of equation (17), which usually is a very difficult task, if not certain additional limitations are provided that are imposed upon the model and the noise process. Therefore, very often, a sub-optimum realization of a Bayesian estimator has to be selected for implementation. 
         [0081]    According to the invention, the filter of choice is a sequential Monte Carlo (SMC) filter, especially a sampling importance resampling particle filter (SIR-PF) which may be considered a special case of a sequential importance sampling particle filter (SIS-PF). In this algorithm, the posterior density t the step k is represented as a sum and is specified by a set of N p  particles: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       p 
                        
                       
                         ( 
                         
                           
                             x 
                             k 
                           
                            
                           
                             Z 
                             k 
                           
                         
                         ) 
                       
                     
                     ≈ 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           N 
                           p 
                         
                       
                        
                       
                         
                           w 
                           k 
                           j 
                         
                         · 
                         
                           δ 
                            
                           
                             ( 
                             
                               
                                 x 
                                 k 
                               
                               - 
                               
                                 x 
                                 k 
                                 j 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   19 
                   ) 
                 
               
             
           
         
       
     
         [0082]    where each particle with the index j has a state x k   j  and a weight W k   j . The sum over all particle weights is one. With SIR-PF, the weights are calculated according to the principle of importance sampling, the so-called proposal density being chosen such that it is p(x k |x k-1 =x k-1   j ), and with a resampling at each time interval. For N p →∞ the posterior approximation comes close to the true possibility density (PDF). Variants of the SIR-PF perform resampling only when necessary. 
         [0083]    Hereunder, a selection of a suitable channel process made according to the present invention will be discussed. 
         [0084]    In order to make use of the advantages of a sequential estimation to benefit the present problem of multipath error reduction/estimation, one has to be able to describe the actual channel characteristics (channel parameters) as precisely as possible, so that the same are covered by p(x k |x k-1 ). In other words: the movement model generated has to be a Markov model and all transition probabilities must be known. With the solution proposed by the present invention, the channel may be advantageously be approximated, for example, as follows:
       The channel is completely characterized by a direct path (index i=1) and up to N n −1 echo signal paths.   At the time k, each path described by the index i has a complex amplitude a i,k  and a relative delay Δτ i,k =τ i,k −τ i,k−1 , where the relative delays of the echo signals can only assume positive values.   The various path delays follow the stochastic process:       
 
         [0000]      τ 1,k =τ 1,k−1 +α 1,k−1   ·Δt+n   τ ,   (20) 
         [0000]      Δτ i,k =Δτ i,k−1 +α i,k−1   ·Δt+n   τ   , i&gt; 1.   (21)       The parameters α i,k  describe the speed at which the path delays change and follow their own process:         
         [0000]    
       
         
           
             
               
                 
                   
                     α 
                     
                       i 
                       , 
                       k 
                     
                   
                   = 
                   
                     
                       
                         ( 
                         
                           1 
                           - 
                           
                             1 
                             K 
                           
                         
                         ) 
                       
                        
                       
                         α 
                         
                           i 
                           , 
                           
                             k 
                             - 
                             1 
                           
                         
                       
                     
                     + 
                     
                       
                         n 
                         α 
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   22 
                   ) 
                 
               
             
           
         
       
       
         
           
             The value and the phase of the individual paths, described by the complex amplitudes a i,k , are eliminated by maximizing the likelihood function for given values Δτ i,k =τ i,k −τ i,k−1  with respect to a i,k . This serves to reduce the parameter space, aiming at a reduction of the complexity. 
             Every path may either be “on” or “off”, specified by the parameter 
           
         
       
     
         [0000]      e i,k ε{0≡“aus”,1≡“ein”}.       The values e i,k  follow a simple Markov process with two states and asymmetric transition probabilities:         
         [0000]        p ( e   i,k =0 |e   i,k−1 =1)= p   onoff ,   (23) 
         [0000]        p ( e   i,k =1 |e   i,k−1 =0)= p   offon ,   (24) 
         [0092]    The stochastic movement model includes two Gaussian noise sources n τ  and n α  as well as the noise process for controlling the state transitions for the values e i,k . These sources provide for the stochasticity of the movement model. The parameter k determines how quickly the values Δτ i,k  can change. Δt refers to the time span between the times k−1 and k. 
         [0093]    It is presumed that all model parameters, i.e. K, Δt, noise variances and the “on/off” Markov model are independent of k (see  FIG. 3 ). It is noted that the movement model directly represents the number of paths as a time-varying parameter equal to Σ i=1   N     m   e i,k . The hidden channel state parameter x k  may thus be represented as: 
         [0000]      └τ 1,k , Δτ 2,k , . . . , Δτ N     m     ,k , α 1,k , . . . , α N     m     ,k , . . . , e N     m     ,k ┘ T    (25) 
         [0094]    When applied to the particle filter algorithm, obtaining the proposal density is simple. Each particle stores the above channel parameters of the movement model and the new state will be found randomly from p(x k |x k−1   j ), which corresponds both to obtaining of values for n α  and n τ  and to the concurrence of the “on”/“off” Markov model and the subsequent updating of the channel parameters for the time k according to the equations (20) to (24). 
         [0095]    Thus, the method of the present invention is characterized by an implementation of the estimator for multipath suppression as a recursive Bayesian filter. Even the method known from the above mentioned article by P. Closas, C. Fernandez-Prades, J. Fernandez-Rubio, A. Ramirez-Gonzalez: “Multipath Mitigation using Particle Filtering” in Proceedings of the ION GNSS 2006, Fort Worth, Tex., USA, September 2006, does not follow the principle illustrated in  FIG. 4 . The reinitialization of the particles and the transfer of covariance matrices used there, differ from the methods provided in this application. Thus, no optimum sequential estimation is proposed, as detailed above. 
         [0096]    The selection of the movement model—proposed by the present invention—with the speeds of change and the variable life cycle of the paths is a particular feature of the method of the present invention. 
         [0097]    The number of paths is implicitly co-estimated in the method proposed by the present invention. At the time k, it results from the sum of the values e i,k . 
         [0098]    As a result, the method of the present invention yields a-posteriori probability density functions (PDF) of the estimated parameters, i.e. not only a fixed estimated value. Ambiguities are also included in the solution. This may be advantageous in the further processing within other modules of the receiver, e.g. for soft location. 
         [0099]    As far as the adjustment of the movement model is concerned, it is important to point out that a sequential estimator only works as well as its state transition model adapts to the real ambient situation. The state model has to store all relevant hidden states in a memory and also has to model their dependencies, where the condition of the Markov process is maintained. Moreover, any storing of measurement noise that influences the likelihood function p(z k |x k ) must explicitly be included as an additional state of the model x so that the measurement noise is i. i. d. (independent and identically distributed). 
         [0100]    The channel state model is due to channel modelling work for multipath-prone environments, such as an urban satellite navigation channel, for example. In effect, the process of setting up a channel model in order to characterize the channel for signal level simulations and reception evaluations is close to establishing a Markov process of the first order for sequential estimation. For particle filtering, the model has to meet the condition that states can be determined with relatively low computational complexity. 
         [0101]    Adapting the model structure and the model parameters to the real channel environment is a task for current and future undertakings. It may even be possible to consider hierarchical models, in which the selection of the current model itself follows a process. In this case, a sequential estimator will automatically select the correct weighting of these models according to their ability to fit the received signal in. 
         [0102]    The embodiment outlined in  FIG. 4  as a block diagram illustrates an example of how the sequential estimator could be integrated into a conventional navigation receiver. This capitalizes on the architecture described in the above mentioned article by B. Krach, M. Lentmaier: “Efficient Soft-Output GNSS Signal Parameter Estimation using Signal Compression Techniques” in Proceedings of the 3rd ESA Workshop on Satellite Navigation User Equipment Technologies, Navitec 2006, Noordwijk, The Netherlands, December 2006, wherein a conventional DLL/PLL loop supports a bank of correlators whose output signals are filtered in an appropriate manner. 
         [0103]    These filtered output signals then serve as measured values from which the likelihood values are calculated in a recursive Bayesian filter. For an efficient calculation, the known proposed methods may be used. The optional prefiltering allows to increase the time interval Δt and to thus reduce the complexity of the Bayesian filter. 
         [0104]    Principally, it is to be noted that the computational complexity of the Bayesian filter algorithm is critical for the integration of the inventive method into a receiver. From a theoretical point of view, it is desirable to operate the sequential Bayesian filter such that it is timed according to the coherent integration period of the receiver, and to work with a large number of particles. 
         [0105]    From a practical point of view, however, it is desirable to reduce the sequential filter rate to the navigation rate and to minimize the number of particles. Existing ML solutions may be helpful in reaching a flexible trade-off between complexity and performance, since one may directly use strategies already developed for the expansion of the observation periods of ML estimators to reduce the rate of the algorithm for a sequential Bayesian filtering. 
         [0106]      FIG. 5  is a diagram illustrating a simulation result for a multipath situation observed. The simulations were performed both for BPSK-modulated signals and for BOC(1,1)-modulated signals. The pseudo ranges [m], i.e. the propagation time x the speed of light, as a function of time [s] in the direct path (line of sight) are indicated by the continuous line, whereas temporary echoes (multipaths) are indicated by short lines. 
         [0107]    The multipath channel situation with up to N m =3 paths used in all simulations and illustrated in  FIG. 5 , has been generated according to the movement model of the present invention, the parameters K=25000, σ n   a =10 −10 , σ n     r   =10 −8  and p onoff =p offon =0.0001 being selected such that they are similar to a typical urban satellite navigation channel environment. The relative amplitudes of the echo signals were chosen to be constant and equal to 0.5, whereas the relative phases change according to Δφ i,k =2πΔ i,k f c , where f c =1575.42 MHz is the frequency of the L 1  carrier. 
         [0108]      FIG. 6  shows results of computer simulations by means of which the performance of the SIS-based sequential estimator is compared with that of a conventional DLL with a “narrow correlator” for a BPSK modulation. Specifically, in the diagram of  FIG. 6 , the performance of the sequential estimation method (lower line) with particle filtering, operating according to the invention, is shown by the distance measurement error [m] as a function of time [s] compared with the result for a conventional DLL with a “narrow correlator” (upper line”. The comparison of the residual error in  FIG. 6  shows that the method proposed by the invention allows for clear improvements. In the simulation, a reduction of the mean square error from 3.77 m to 0.7819 m was achieved for BPSK modulation. 
         [0109]    Although the invention has been described and illustrated with reference to specific embodiments thereof, it is not intended that the invention be limited to those illustrative embodiments. Those skilled in that art will recognize that variations and modifications can be made without departing from the true scope of the invention as defined by the claims that follow. It is therefore intended to include within the invention all such variations and modifications as fall within the scope of the appended claims and equivalents thereof.