Abstract:
A Global Positioning System (GPS) acquisition method is provided. A GPS signal is first received, comprising a plurality of data bits, each repeating for a bit period. A search space is then formed, comprising a plurality of elements each associated with a presumed offset and a presumed code phase. Before bit-transition of each bit period, element values of the elements are accumulated by substituting the data bits into a coherent-combination algorithm. After bit-transition of each bit period, the element values are accumulated by substituting the data bits into a differential-coherent combination algorithm.

Description:
CROSS REFERENCE TO RELATED APPILCATIONS  
       [0001]     This application claims the benefit of U.S. Provisional Application No. 60/756,779, filed Jan. 6, 2006. 
     
    
     BACKGROUND OF THE INVENTION  
       [0002]     1. Field of the Invention  
         [0003]     The invention relates to a Global Positioning System, and in particular, to a GPS acquisition method for use in weak signal environments.  
         [0004]     2. Description of the Related Art  
         [0005]      FIG. 1  shows a sequence of data bits with bit-transition. In a Global Positioning System (GPS) receiver, transmission signals are demodulated and digitized into a sequence of data bits. According to GPS L2 civil signal standard, a bit value sustains for a period, such as 20 ms for L2 civil moderate (CM) maximal length code. Bit transition may therefore occur every 20 ms. Pseudo-random number (PRN) codes and carrier signals sent from several GPS satellites must be acquired and tracked for use. A typical receiver channel operates in two modes: acquisition and tracking. In acquisition mode, PRN code phase (measured by start time of the PRN code) and carrier Doppler offset are estimated via a search process. The estimated quantities are then used and continuously updated in tracking mode.  
         [0006]      FIG. 2  shows a search space m(n) formed by presumed code phases and presumed offsets. A received GPS signal is typically defined as follows:
   r ( t )= √{square root over (A)}·N ( t )· s ( t −π)· e   j2πƒ     d     t   +n ( t )  (1) 
         [0007]     The parameter A represents the power of the received GPS signal. N(t) denotes a navigation bit value at time t. Each bit value has a span (bit period) of 20 ms. π is an unknown code phase to be determined. f d  is an unknown Doppler offset value in KHz. n(t) is an assumed additive white Gaussian noise (AWGN).  
         [0008]     If the received GPS signal r(t) is digitized at a 5 MHz sample rate, 5000 samples are available per 1 ms. For most applications, frequency range of the received signal with Doppler offset falls within ±10 KHz with respect to a center frequency 1250 KHz. To simplify the search for Doppler offset value, the frequency range is coarsely sliced into 21 presumed values, −10 to 10 KHz with a step size of 1 KHz. The search space m(n) is therefore formed to determine the unknown code phase and the unknown Doppler offset value forcibly:
 
 m ( n )={ y   i,j ( n )| i,jεR, 1 ≦i≦p, 1 ≦j≦q}   (2)
 
         [0009]     The parameter n denotes an n th  bit period, and the n th  search space m(n) comprises p*q elements where the amount of possible code phases p is 5000, and the amount of possible offset values q is 21. y i,j (n) is a correlation value corresponding to an (i th , j th ) element calculated per code time:  
                 y     i   ,   j       ⁡     (   n   )       =       ∫       (     n   -   i     )     ⁢   T     nT     ⁢       r   ⁡     (   t   )       ⁢       s   ⁡     (     t   -     τ   i       )       ·     ⅇ     j   ⁢           ⁢   2   ⁢   π   ⁢           ⁢     f   j     ⁢   t         ⁢     ⅆ   t                 (   3   )             
 
         [0010]     The parameter T represents the code time (1 ms for this case). π i  is the i th  presumed code phase, and f j  is the j th  presumed offset. A total of 5000*21 correlation values are simultaneously calculated within 1 ms, and a peak can be found, with corresponding code phase and offset value thereof used as the acquisition result.  
         [0011]     In high SNR situations (e.g. outdoors or in rural areas), the 1-ms correlation is generally satisfactory for detecting code phase and Doppler offset. For weak signal environments (low SNR situation), however, the correlation results y i,j (n) are typically accumulated for multiple periods before selection of a peak as an answer, such that possibility of false detection is reduced. Various conventional accumulation algorithms are readily presented, such as coherent combination (CC), non-coherent combination (NCC) and differential-coherent combination (DCC).  
         [0012]      FIG. 3  shows an integral calculated by a conventional coherent combination algorithm. The coherent combination algorithm is presented as:  
               P   CC   N     =     max   ⁢     {              ∑     n   =   1     N     ⁢       y     i   ,   j       ⁡     (   n   )              2     }               (   4   )               
         [0013]     Correlation values y i,j (n) corresponding to the (i th , j th ) element are accumulated for consecutive code times 1 to N, and their sums squared before selection of a peak therefrom. The coherent combination algorithm provides excellent accuracy for peak detection without squaring loss. As a result of the navigation bit-transition periodically occurring as shown in  FIG. 1 , however, the integral may be deteriorated. As shown in  FIG. 3 , a coherent combination integral of a (i th , j th ) element in the search space is also referred to as an element value of a corresponding correlation value y i,j (n). The horizontal axis denotes the integration time N (the unit is referred to as code time). The element value grows before the bit-transition occurring at N=10 and 30, and decreases thereafter due to a cancellation effect induced by complex number operations in formula (3). As seen, the element value cannot effectively increase to distinguish a peak from noise.  
         [0014]     The non-coherent combination algorithm is denoted as follows:  
               P   NCC   N     =     max   ⁢     {       ∑     n   =   1     N     ⁢              y     i   ,   j       ⁡     (   n   )            2       }               (   5   )             
 
         [0015]     Based on the non-coherent combination (NCC) algorithm, absolute values are taken before summation, alleviating the bit-transition cancellation problem. As SNR decreases, however, an element value calculated from the non-coherent combination algorithm may suffer from squaring loss, making it impractical for weak signal environment. Therefore, a more flexible combination scheme is desirable in GPS acquisition.  
       BRIEF SUMMARY OF THE INVENTION  
       [0016]     An exemplary embodiment of a Global Positioning System (GPS) acquisition method is provided. A GPS signal is first received, comprising a plurality of data bits, each repeated for a bit period. A search space is then formed, comprising a plurality of elements each associated with a presumed offset and a presumed code phase. Before bit-transition of each bit period, element values of the elements are accumulated by substituting the data bits into a coherent-combination algorithm. After bit-transition of each bit period, the element values are accumulated by substituting the data bits into a differential-coherent combination algorithm.  
         [0017]     The search space may be partitioned into a plurality of sub-spaces. Signal to noise ratio (SNR) of the GPS signal is further estimated.  
         [0018]     When accumulating the element values before and after the bit-transition, correlations of the data bits with each presumed offset and presumed code phase in the search space are forcibly calculated to generate a plurality of correlation values. Element values for each element are accumulated in the search space respectively with integrals of corresponding correlation values calculated by either the coherent or differential-coherent combination algorithm.  
         [0019]     The coherent combination algorithm contributes to an element value of an element by squaring a sum of consecutive correlation values corresponding to the element within a period of code times. The differential-coherent combination algorithm contributes to an element value of an element by multiplying a current correlation value with a previous correlation value corresponding to the element for each code time, and summing the multiplications as a result that contributes to the element value.  
         [0020]     Among the element values, a peak is detected based on a SNR dependent peak threshold. When the peak is detected, a presumed offset and a presumed code phase associated with the peak are reported as an acquisition result.  
         [0021]     When detecting the peak, a largest value and a second largest value are found among the element values. A ratio of the largest to the second large values is calculated. If the ratio exceeds the peak threshold, the largest value is confirmed as the peak.  
         [0022]     Bit-transitions of each bit period are detected using a SNR dependent bit-transition threshold. The bit-transition detection of each bit period comprises performing a forward accumulation using the coherent combination algorithm to obtain a first value and a second value corresponding to two consecutive code times within the bit period, wherein the first value is prior to the second value. A ratio of the first to second values is calculated. The ratio is compared with the bit-transition threshold. If the ratio exceeds the bit-transition threshold, bit-transition is confirmed at the code time corresponding to the second value. Likewise, a backward accumulation is performed to optimize bit-transition detection for later half of the bit period.  
         [0023]     The bit period is 20 ms, and the code time is 1 ms. The amount of presumed offsets is 21, ranging from −10 KHz to +10 KHz with a step size 1 KHz. The amount of presumed code phases is 5000. A detailed description is given in the following embodiments with reference to the accompanying drawings. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0024]     The invention can be more fully understood by reading the subsequent detailed description and examples with references made to the accompanying drawings, wherein:  
         [0025]      FIG. 1  shows a sequence of data bits with bit-transition;  
         [0026]      FIG. 2  shows a search space formed by presumed code phases and presumed offsets;  
         [0027]      FIG. 3  shows an integral calculated by a conventional coherent combination algorithm;  
         [0028]      FIG. 4  is a flowchart of an embodiment of the adaptive GPS acquisition method;  
         [0029]      FIG. 5  shows an embodiment of the search space;  
         [0030]      FIG. 6  shows an embodiment of bit-transition detection; and  
         [0031]      FIG. 7  shows an embodiment of the accumulation of an element value. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0032]     The following description is of the best-contemplated mode of carrying out the invention. This description is made for the purpose of illustrating the general principles of the invention and should not be taken in a limiting sense. The scope of the invention is best determined by reference to the appended claims.  
         [0033]     Another conventional combination scheme is differential-coherent combination algorithm, denoted as follows:  
               P   DCC   N     =     max   ⁢     {            ∑     n   =   1     N     ⁢         y     i   ,   j       ⁡     (     n   -   1     )       ·       y     i   ,   j       ⁡     (   n   )                }               (   6   )             
 
         [0034]     As shown in formula (6), correlation values of two consecutive search spaces are multiplied. In this way, the element value is not affected by either bit-transition or squaring loss, demonstrating a preferable solution. Even though differential-coherent combination avoids such issues, its accumulation efficiency is still less than coherent combination. Thus, an adaptive method taking both advantages from coherent and differential-coherent combinations, is proposed.  
         [0035]     As an example for description, 20 code times are considered as one bit period, with each equivalent to 1 ms in the embodiment. Element values in a search space are individually accumulated for a plurality of code times (may be more than one bit period) in weak signal situations. Bit transition may occur at any position within a bit period. In the invention, correlation values before the bit-transition are accumulated using coherent combination algorithm, and those after the bit-transition are accumulated using differential-coherent combination algorithm.  
         [0036]     For a search space m(n) as shown in  FIG. 2 , every single element in the search space is associated with a code phase i and an offset value j. Thus, i*j correlation values y i,j (n) are forcibly calculated every code time. Coherent combination or differential-coherent combination algorithms are selectively used to increase the corresponding element values. The forced search is recursively conducted until one element value is determined to be a peak value according to an SNR dependent peak threshold.  
         [0037]     The integral increased by coherent combination can be represented as follows:  
                   P   CC     ⁡     (     i   ,   j     )       α   β     =              ∑     n   =   α     β     ⁢       y     i   ,   j       ⁡     (   n   )              2             (   7   )             
 
         [0038]     where i denotes i th  presumed code phase, j denotes j th  presumed offset value, and α and β are starting and terminating code time indices for integration. The correlation value y i,j (n) is calculated from a received data bit with the j th  presumed offset and the i th  presumed code phase at an n th  code time based on formula (3). Specifically, the output of formula (7) indicates a square of sums of correlation values y i,j (n) corresponding to a (i th ,j th ) element in the search space, integrated from code times α to β.  
         [0039]     Likewise, the integral increased by differential-coherent combination is expressed as:  
                   P   DCC     ⁡     (     i   ,   j     )       α   β     =       ∑     n   =   α     β     ⁢              y     i   ,   j       ⁡     (     n   -   1     )       ·       y     i   ,   j       ⁡     (   n   )                        (   8   )             
 
         [0040]     In which correlation values of two consecutive code times are multiplied, absolutized and summed. Based on the aforementioned formulae, an element value contributed by the integrals of coherent combination and differential-coherent combination is expressed in a general form:  
                   P   ACC     ⁡     (     i   ,   j     )       N     =         ∑     k   =   1       n   -   1       ⁢     {           P   CC     ⁡     (     i   ,   j     )         20   ⁢     (     k   -   1     )           20   ⁢     (     k   -   1     )       +     λ   k         +         P   DCC     ⁡     (     i   ,   j     )           20   ⁢     (     k   -   1     )       +     λ   k     +   1       20   ⁢   k         }       +         P   CC     ⁡     (     i   ,   j     )         20   ⁢     (     n   -   1     )           20   ⁢     (     n   -   1     )       +     λ   n         +         P   DCC     ⁡     (     i   ,   j     )           20   ⁢     (     n   -   1     )       +     λ   n     +   1       20   ⁢   n                 (   9   )             
 
         [0041]     A N th  element value is a summation of coherent combination and differential-coherent combination integrals increased from code times 1 to N. This duration may comprise (n−1) complete bit periods, and residual code times in the n th  bit period. λ k  denotes position of bit-transition in k th  bit period. Formula (9) shows coherent combination integrals counted before bit-transition, and, conversely, after bit-transition, differential-coherent combination integrals are counted.  
         [0042]      FIG. 4  is a flowchart of an adaptive GPS acquisition method according to the invention. The aforementioned concepts can be concluded into the following executive steps. In step  402 , GPS signals are recursively received and demodulated into a data bit stream, and a search space is formed to forcibly observe correlations of every data bit with all possible offset values and code phases. In step  404 , a coherent combination algorithm is used to increase the element values in the search space. In step  406 , it is determined whether a peak exists among the element values. If so, the acquisition is concluded in step  410 , and a presumed offset and a presumed code phase associated with that element value is output as the acquisition result. In step  408 , occurrence of bit-transition is checked. If no bit-transition is detected for the current code time, the process returns to step  404 , and increase continues of element values with coherent combination algorithm. If bit-transition is detected in step  408 , the differential-coherent combination algorithm is used rather than the coherent combination to increase the element values in step  412 . Likewise, step  414  determines the peak. If detected, step  410  is executed. In step  416 , it is determined whether the current bit period is complete. If not, the process returns to step  412 , continuing increase of element values using differential-coherent combination algorithm. If the bit period is complete, the process goes to step  404 , returning to coherent combination for next bit period.  
         [0043]      FIG. 5  shows an embodiment of the search space m(N) and peak detection. For each code time, a total of p*q element values are obtained, each associated with a presumed code phase i and offset value j. At the N th  code time, element values P ACC (i,j) N  are shown in  FIG. 5 , increased with varying heights. Among the element values in the search space m(N), a peak is detected according to the following formula:  
                   max     m   ⁡     (   N   )         ⁢     {         P   ACC     ⁡     (     i   ,   j     )       1   N     }             max     m   ⁡     (   N   )           2   ⁢   nd       ⁢     {         P   ACC     ⁡     (     i   ,   j     )       1   N     }         &gt;     TH   P             (   10   )               
         [0044]     The upper part represents a maximum element value among the search space m(N), and the lower part a second large element value. The ratio is compared against the parameter TH P , a peak threshold. More specifically, the peak threshold TH P  may be a flexibly adjusted value dependent on SNR of the GPS signal. The SNR can be estimated by considering the standard deviation of the received GPS signal with surrounding noise, which is assumed to be a known technique. The peak threshold TH P  may increase as the SNR increases, and decreases reversely. If the ratio exceeds the peak threshold TH P , indicating a distinct peak obtained from the growing process, it is confirmed to be the correct acquisition result.  
         [0045]     Alternatively, the search space m(N) may be partitioned into a plurality of sub-spaces, such as m 1 (N), m 2 (N) . . . M L (N), and the total of code phases p equally divided by L. Thus, each sub-space comprises L*q elements. The peak detection can be individually processed in each subspace, by which the performance enhancement is significant. Formula (10) is therefore rewritten to described this case:  
                           max       m   l     ⁡     (   N   )         ⁢     {         P   ACC     ⁡     (     i   ,   j     )       1   N     }             max       m   l     ⁡     (   N   )           2   ⁢   nd       ⁢     {         P   ACC     ⁡     (     i   ,   j     )       1   N     }         &gt;     TH   P       ,             l   =   1     ,   2   ,   3   ,   …   ⁢           ,   L                 (   11   )             
 
         [0046]     As shown in  FIG. 1 , at most one bit-transition may occur every 20 ms. Period boundaries on a receiver may not necessarily meet those of the data bit stream, thus positions of the bit-transition are uncertain for the receiver.  FIG. 6  shows an embodiment of bit-transition detection. A forward detection and a backward detection are simultaneously executed. In the forward detection, a ratio of two consecutive coherent combination integrals is calculated and compared with a bit-transition threshold THB:  
                     P   CC     ⁡     (     i   ,   j     )       1     N   -   1             P   CC     ⁡     (     i   ,   j     )       1   N       &gt;     TH   B             (   12   )             
 
         [0047]     where N is a value between 1 and 20. As the element value incrementally grows using coherent combination algorithm, the occurrence of bit-transition inevitably causes a sudden sink as the code time BT f  shown in  FIG. 6 . Thus, when the ratio of formula (12) exceeds the bit-transition threshold TH B , the occurrence of bit-transition is confirmed.  
         [0048]     Likewise, in a backward detection, a ratio is calculated as follows:  
                     P   CC     ⁡     (     i   ,   j     )         20   -   N     20           P   CC     ⁡     (     i   ,   j     )         21   -   N     20       &gt;     TH   B             (   13   )             
 
         [0049]     In which the integration is processed backward from the 20 th  code time to the (20−N) th  code time. A significant sink may also be found at the code time BT b . Theoretically, the forward and backward detection will obtain the same bit-transition point, however, the forward detection is efficient for first half of the bit period (1 ms to 10 ms) while the backward detection is feasible for the later half (11 ms to 20 ms). Simultaneously performing both directions can significantly increase the performance. As another example, the bit-transition threshold TH B  is also designed to be a programmable value dependent on SNR.  
         [0050]     Alternatively, the bit-transition detection can be individually processed in each of the subspaces m 1 (N), m 2 (N) . . . M L (N). The (i th , j th ) element value used to calculate the coherent combination integral may be chosen from any local maximums in the subspaces.  
         [0051]      FIG. 7  shows an embodiment of the accumulation of an element value. An (i th , j th ) element is assumed to be the correct acquisition result, and its growing process is specifically described for best understanding. The horizontal axis is code time N, and the vertical axis is the accumulated element value calculated by formula (9). The doted line below shows a comparative value accumulated using coherent combination algorithm. The ultimate element value obtained at code time N is:  
                   P   ACC     ⁡     (     i   ,   j     )       N     =           P   CC     ⁡     (     i   ,   j     )       1     λ   1       +         P   DCC     ⁡     (     i   ,   j     )           λ   1     +   1     20     +         P   CC     ⁡     (     i   ,   j     )       21     21   +     λ   2         +         P   DCC     ⁡     (     i   ,   j     )         22   +     λ   2       40     +         P   CC     ⁡     (     i   ,   j     )       41   N               (   14   )               
         [0052]     It can be seen that the accumulation result is relatively efficient in comparison to the conventional coherent combination algorithm. In the embodiment, the bit period is 20 ms, and the code time is 1 ms. The amount of presumed offsets is 21, ranging from −10 KHz to +10 KHz with a step size 1 KHz, and the amount of presumed code phases is 5000. However, these values can be varied for different applications. The GPS acquisition method may be implemented in software or in a DSP-based GPS receiver. While the invention has been described by way of example and in terms of preferred embodiment, it is to be understood that the invention is not limited thereto. To the contrary, it is intended to cover various modifications and similar arrangements (as would be apparent to those skilled in the art). Therefore, the scope of the appended claims should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements.