Shared memory architecture in GPS signal processing

Information

  • Patent Grant
  • 6930634
  • Patent Number
    6,930,634
  • Date Filed
    Wednesday, December 4, 2002
    22 years ago
  • Date Issued
    Tuesday, August 16, 2005
    19 years ago
Abstract
A shared memory architecture for a GPS receiver, wherein a processing memory is shared among the different processing functions, such as the correlator signal processing, tracking processing, and other applications processing. The shared memory architecture within the GPS receiver provides the memory necessary for signal processing operations, such as the massively parallel processing, while conserving memory cost by re-using that same memory for other GPS and non-GPS applications. The shared memory architecture for a GPS receiver provided in accordance with the principles of this invention thereby significantly minimize the costly memory requirement often required of extremely fast signal acquisition of a GPS receiver.
Description
FIELD OF INVENTION

This invention relates to the field of GPS receivers.


BACKGROUND OF INVENTION


FIG. 1 illustrates a typical GPS radio receiver 10, while FIG. 2 provides a general flow chart illustrating the general operations of GPS receiver 10 such as a satellite signal acquisition, tracking, or re-acquisition, and navigational processing. As illustrated in the simplified block diagram of a typical GPS receiver 10 shown in FIG. 1, a signal processing block 20 is provided to perform satellite signal acquisition and processing on a digitized IF signal 19 received via receiver antenna 12. Signal processing block 20 typically performs a two-dimensional search for a satellite signal, in time (code phase) and frequency. To decrease the amount of time needed for GPS signal acquisition in time and frequency domains, a massively parallel architecture is usually required for searching in parallel a large number of code positions and frequency uncertainties. In the code phase search, the required number of code positions is directly related to initial time uncertainty. A large number of corellators allows a quick, parallel search of many code positions. In the frequency search, a large number of frequency bins architecture speeds up searching multiple frequency uncertainties in parallel, thereby reducing the total time for search.


As illustrate in FIG. 1, signal processing 20 consists of three functional stages: a first stage consists of channel correlation signal processing 22 that compares (or correlates) digitized signal 19 with a locally generated code that attempts to replicate the P or C/A code generated by a satellite. The replica code searches a “space” that consists of the unique codes generated by the different satellites, the temporal position of the code being sent at any given time, and the Doppler frequency offset caused by the relative motion of the satellite and user. Generally, correlator signal processing unit 22 can perform parallel correlations with multiple code/position/Doppler combinations simultaneously in a multiple channel fashion, usually up to 12. The next functional stage of signal processing 20 comprises tracking processing unit 24, typically provided by a tracking processing CPU. The tracking processing CPU uses correlator information from correlator signal processing unit 22 to ascertain the probability of correctness of a code/position/Doppler combination and to “follow”, or track, that signal once it is found. Tracking processing unit 24 includes having the tracking CPU program the correlator signal processing unit 22 where to search for a GPS satellite signal. Once a signal is found and locked onto, the tracking CPU also extracts the 50 Hz modulated data that contains navigation information transmitted by the GPS satellite. Finally, a navigation processing unit 26, comprising a navigation processing CPU, uses data collected by the correlator signal processing unit 22 and tracking processing unit 24 to perform the calculations to determine the user's position, velocity, and time.


In the typical GPS signal processing 20, an associated and dedicated memory unit is coupled to each functional unit stage. Thus, correlator signal processing unit 22 is typically coupled to an associated dedicated correlation processing memory unit 28 shown in FIG. 1. Coherent and non-coherent I & Q samples are stored in correlation processing memory 28 received from correlator signal processing unit 22. Tracking processing unit 24 is coupled to a tracking unit memory 30 to store the code, data, and parameters utilized by the tracking processor CPU for acquisition and tracking processing such as, for example, carrier loops, code loops, code lock detect, costas lock detect, bit synchronization, data demodulation. Navigation processing unit 26 is coupled to a navigation processing memory 32 for storing the code and data for the navigation processing CPU, such as calculation of position and time.


Thus, in operation, typical GPS receiver 10 requires significant hardware and memory to search, utilizing a large number of correlators and multiple frequency bins to implement. For example, an 8 frequency bin search should reduce the search time by a factor of 8 but it will require 4 times the memory to store the coherent integration samples and 8 times the memory to store the non-coherent integration samples. In order to achieve low cost, commercial GPS receiver architectures are deterred from using massively parallel architectures to avoid the cost of massively parallel implementation. There is therefore a need for a GPS signal processing architecture that minimizes the costly memory requirement and still achieves extremely fast signal acquisition.


SUMMARY OF INVENTION

A shared memory architecture for a GPS receiver is provided, wherein a processing memory is shared among the different processing functions, such as the correlator signal processing, tracking processing, and other applications processing. The shared memory architecture within the GPS receiver provides the memory necessary for signal processing operations, such as the massively parallel processing, while conserving memory cost by re-using that same memory for other GPS and non-GPS applications. The shared memory architecture for a GPS receiver provided in accordance with the principles of this invention thereby minimize the costly memory requirement often required of extremely fast signal acquisition of a GPS receiver.





BRIEF DESCRIPTION OF DRAWINGS


FIG. 1 is a block diagram describing a prior art GPS receiver.



FIG. 2 is a flowchart describing the operation of a GPS receiver.



FIG. 3 is a block diagram describing the shared memory architecture of the invention.



FIG. 4 is a block diagram describing the channel correlator signal processing.



FIGS. 5A and 5B are block diagrams describing IQRAM and IQSQRAM arbitration in channel correlator signal processing.



FIG. 6 is a block diagram describing a memory map for IQRAM for the channel correlator signal processing.



FIG. 7 is a block diagram describing a memory map for IQSQRAM in acquisition for the channel correlator signal processing.



FIG. 8 is a block diagram describing a memory map for IQSQRAM in tracking/reacquisition mode.



FIG. 9 is a block diagram describing an example of a two way set associative cache memory map for both tracking and navigation processing.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENT(S)


FIG. 3 shows a shared memory architecture for a GPS receiver 100, wherein a signal processing memory 144 is shared among different signal processing functional units, such as a correlator signal processing unit 122, tracking processing unit 124 and applications processing unit 126. FIG. 4 shows a more detailed functional block diagram of processing memory 144 comprising an IQRAM 53 and an IQSQRAM 59. FIG. 4 further illustrates shared memory architecture in operation, as an illustration, such as during operations of channel correlator signal processing unit 122.


In operation, an IQ separator and down converter 46 samples a satellite IF signal 19 and separates signal 19 into a pair of I and Q signals 47. I and Q signal pair 47 is down converted to a baseband frequency before being provided to a Doppler rotator 48, which provides Doppler rotation of I and Q signal pair 47. Both carrier phase and carrier frequency are programmed in the Doppler rotator 48 by a tracking processing CPU of tracking processing unit 124 of FIG. 3. As shown in FIG. 4, correlator 50 receives the Doppler rotated I and Q signal pair 49 and correlates signal pair 49 with a replica I and Q code produced by a code generator 52. An IQ accumulator 54 receives both I and Q samples 64 from correlator 50 and accumulates the samples over a coherent integration period. The accumulated results are stored separately in an IQRAM 53. The multiple frequency bin correlator 56 then receives I and Q data provided from IQ accumulator 54 and performs an accumulation at IQSQ accumulator 58 on the results of the square root of the sum of I-squared plus Q-squared for a period of time specified as non-coherent integration. The accumulation results are then stored in an IQSQRAM memory 59 of processing memory 144.



FIGS. 5A and 5B further illustrate a more detailed block diagram of an IQRAM arbitration (FIG. 5A) and an IQSQRAM arbitration (FIG. 5B) provided to arbitrate use of IQRAM 53 and IQSQRAM 59. FIGS. 5A-5B illustrate the IQRAM and IQSQRAM arbitrator 60 and 62 that control access to shared memory IQRAM 53 and IQSQRAM 59, i.e., such as arbitrating memory use between channel correlator signal processing unit 122 and the other functions seeking access to memory 144. For the IQRAM arbitrator 60, the multiple memory access sources comprise the coherent integration of I and Q data from the output of coherent integration function 64 of correlator signal processing unit 122, the multipath/early—late processing 66 (i.e., for sampling data used for multipath mitigation by the tracking processor), the cache tag and data from the cache controller 68 (i.e., used to speed up memory accesses for all the signal processing, including tracking processing and navigation processing), and any application processing 126. In this example, during tracking, the IQRAM arbitrator 60 arbitrates the multiple sources seeking access to IQRAM 53. The IQSQRAM arbitrator 62 shown in FIG. 5B includes controlling access from the non-coherent integration of I and Q signals 74, access to parameters stored for the tracking loops 76, multiple frequency bin correlation 56 (FIG. 4), the convolution decoder 80 (used for a special differential GPS function), and any application processing functions 126. The arbitrator, such as the IQSQRAM arbitrator 62, arbitrates the multiple sources seeking access to the IQSQRAM 59.



FIG. 6 shows an example of the memory map 653 of the IQRAM 53 during our tracking operation example. There are three different address ranges for three types of memory sources: the coherent integration of I and Q data from the correlator outputs (multiple samples in acquisition mode, single sample in track/re-acquisition mode), the multipath/early-late sample data, and the cache tag/data. For this example, in satellite acquisition mode the whole address space of 0x000 though 0x1f7 is used to store the multiple sample (in this case four) coherent integrations needed to search multiple frequency bins simultaneously. In track, or reacquisition modes, however, only a single sample needs to be collected instead of four. Thus, in track/reacquisition modes, the coherent integration I and Q data is stored only in the address range from 0x000 to 0x077. This frees up the remaining space to be used for other functions. The multipath/early-late sampling data is stored in the address range from 0x080 to 0x0ff. The cache tag/data for tracking or navigation processing is stored in the range from 0x100 to 0x1ff. FIG. 9 shows a structure for a 2 way set associative cache implementation of processing memory 144. The cache can be used as the instruction and data cache for the tracking and navigation processing functions to speed them up. The memory region used as cache can alternatively be used as fast local RAM for data storage by the tracking processor or applications processor. Thus, same areas of the address map are shared by multiple functions, including other non-GPS applications, such as navigation processing, GPS location processing, wireless networking protocol processing, and other application processing that would be desirable to incorporate into GPS receiver 100.


FIG. 7 and FIG. 8 show the memory map 759 and 859 for IQSQRAM 59 for other GPS functions, such as acquisition (or re-acquisition). The memory requirements once again are different for acquisition mode and track/reacquisition modes. In acquisition mode, 1920 words in address range of 0x000 to 0x77f are used to store noncoherent accumulations. In track/reacquisition modes, however only 240 words stored in address range 0x000 to 0x0ef are needed to store the noncoherent accumulations. This frees up the remaining space for other functions. In this example the other functions include convolutional decoder parameters and data, and expanded tracking processor parameters and data.



FIGS. 7-8 illustrates sample memory mapping for memory IQSQRAM 59 during different modes. The memory mapping of IQRAM 53 and IQSQRAM 59 of processing memory 144 as illustrated in FIGS. 6-8 is a sample implementation. It is understood that this shared memory mapping in GPS receiver 100 can be extended to process other applications performed by the GPS receiver, such as navigation processing, GPS location processing, processing wireless networking protocols, to just name a few. It should be understood that the shared memory architecture, such as illustrated with reference to FIGS. 3-9 can be applied to other GPS receiver applications contemplated as being within a GPS receiver. The shared memory architecture within the GPS receiver provides the memory necessary for signal processing operations, such as the massively parallel processing, while conserving memory cost by re-using that same memory for other GPS and non-GPS applications. The shared memory architecture for a GPS receiver provided in accordance with the principles of this invention thereby minimize the costly memory requirement often required of extremely fast signal acquisition of a GPS receiver.


Foregoing described embodiments of the invention are provided as illustrations and descriptions. They are not intended to limit the invention to precise form described. In particular, Applicant(s) contemplate that functional implementation of invention described herein may be implemented equivalently in hardware, software, firmware, and/or other available functional components or building blocks. Other variations and embodiments are possible in light of above teachings, and it is thus intended that the scope of invention not be limited by this Detailed Description, but rather by claims following.

Claims
  • 1. A shared memory architecture for a receiver system comprising a memory space shared commonly by two or more receiver functions, the memory space including space occupied by a first memory and a second memory, wherein the first memory accumulates coherent integration results and the second memory accumulates non-coherent integration results, and wherein the receiver functions comprises a correlator signal processing, a tracking processing and an application processing unit.
  • 2. The shared memory architecture of claim 1 wherein the first memory is used as the system memory for a fast local memory or system cache during tracking or application processing.
  • 3. The shared memory architecture of claim 1, wherein the application processing comprises navigation processing.
  • 4. The shared memory architecture of claim 1, wherein the application processing comprises GPS location processing.
  • 5. The shared memory architecture of claim 1, wherein the application processing comprises wireless networking protocol processing.
  • 6. A method for sharing memory among receiver functions, said method comprising: providing a memory space occupied by a first memory and a second memory, wherein the first memory accumulates coherent integration results and the second memory accumulates non-coherent integration results; allocating the memory space using a first set of address ranges for receiver functions operable during a first signal acquisition mode of a receiver; and using a second set of address ranges for receiver functions operable during a second signal acquisition mode of the receiver.
  • 7. The method of claim 6, further including determining a signal acquisition mode for the receiver.
  • 8. The method of claim 7, further including arbitrating access to the memory space allocated for the receiver functions in response to determining a signal acquisition mode.
  • 9. The method of claim 7, wherein determining further includes determining whether the signal acquisition mode is at least one of signal acquisition and signal reacquisition.
  • 10. The method of claim 6, wherein allocating further includes memory mapping the memory space in the first address ranges and the second address ranges.
  • 11. The method of claim 6, wherein the receiver functions operable during the first signal acquisition mode and the second signal acquisition mode include at least one of correlator signal processing, tracking processing, and navigation processing.
  • 12. The method of claim 6, wherein the receiver functions operable during the first signal acquisition mode and the second signal acquisition mode include at least one of coherent integration of correlated I and Q data, non-coherent integration of correlated I and Q data, sampling data used for multipath mitigation, cache tagging of data, multiple frequency bin correlation, and convolutional decoding.
  • 13. The method of claim 6, wherein allocating further includes overlapping at least a portion of the first set of address ranges with the second set of address ranges.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. utility application entitled, “Shared Memory Architecture in GPS Signal Processing,” having Ser. No. 09/465,985, filed Dec. 16, 1999 now U.S. Pat. No. 6,526,322, which is entirely incorporated herein by reference.

US Referenced Citations (108)
Number Name Date Kind
4426712 Gorski-Popiel Jan 1984 A
4445118 Taylor et al. Apr 1984 A
4463357 MacDoran Jul 1984 A
4578678 Hurd Mar 1986 A
4667203 Counselman, III May 1987 A
4701934 Jasper Oct 1987 A
4754465 Trimble Jun 1988 A
4785463 Janc et al. Nov 1988 A
4809005 Counselman, III Feb 1989 A
4821294 Thomas, Jr. Apr 1989 A
4884041 Walker Nov 1989 A
4890233 Ando et al. Dec 1989 A
4894662 Counselman Jan 1990 A
4998111 Ma et al. Mar 1991 A
5014066 Counselman, III May 1991 A
5036329 Ando Jul 1991 A
5043736 Darnell et al. Aug 1991 A
5108334 Eschenbach et al. Apr 1992 A
5172076 Brown Dec 1992 A
5202829 Geier Apr 1993 A
5225842 Brown et al. Jul 1993 A
5293170 Lorenz et al. Mar 1994 A
5311195 Mathis et al. May 1994 A
5323164 Endo Jun 1994 A
5343209 Sennott et al. Aug 1994 A
5345244 Gildea et al. Sep 1994 A
5347536 Meehan Sep 1994 A
5379224 Brown et al. Jan 1995 A
5402347 McBurney et al. Mar 1995 A
5416712 Geier et al. May 1995 A
5418538 Lau May 1995 A
5420592 Johnson May 1995 A
5420593 Niles May 1995 A
5440313 Osterdock et al. Aug 1995 A
5450344 Woo et al. Sep 1995 A
5489878 Gilbert Feb 1996 A
5504684 Lau et al. Apr 1996 A
5548553 Cooper et al. Aug 1996 A
5592173 Lau et al. Jan 1997 A
5623414 Misra Apr 1997 A
5625668 Loomis et al. Apr 1997 A
5635879 Sutardja et al. Jun 1997 A
5663734 Krasner Sep 1997 A
5663735 Eshenbach Sep 1997 A
5764184 Hatch et al. Jun 1998 A
5781156 Krasner Jul 1998 A
5786789 Janky Jul 1998 A
5796662 Kalter et al. Aug 1998 A
5812087 Krasner Sep 1998 A
5825327 Krasner Oct 1998 A
5828694 Schipper Oct 1998 A
5831574 Krasner Nov 1998 A
5841396 Krasner Nov 1998 A
5845203 LaDue Dec 1998 A
5854605 Gildea Dec 1998 A
5874914 Krasner Feb 1999 A
5877724 Davis Mar 1999 A
5877725 Kalafus Mar 1999 A
5883594 Lau Mar 1999 A
5884214 Krasner Mar 1999 A
5897605 Kohli et al. Apr 1999 A
5899994 Mohamed et al. May 1999 A
5901171 Kohli et al. May 1999 A
5903654 Milton et al. May 1999 A
5907809 Molnar et al. May 1999 A
5917383 Tso et al. Jun 1999 A
5917444 Loomis et al. Jun 1999 A
5920283 Shaheen et al. Jul 1999 A
5923703 Pon et al. Jul 1999 A
5926131 Sakumoto et al. Jul 1999 A
5936572 Loomis et al. Aug 1999 A
5943363 Hanson et al. Aug 1999 A
5945944 Krasner Aug 1999 A
5950221 Draves et al. Sep 1999 A
5963582 Stansell, Jr. Oct 1999 A
5977909 Harrison et al. Nov 1999 A
5982324 Watters et al. Nov 1999 A
5983109 Montoya Nov 1999 A
5987016 He Nov 1999 A
5999124 Sheynblat Dec 1999 A
5999125 Kurby Dec 1999 A
6002362 Gudat Dec 1999 A
6002363 Krasner Dec 1999 A
6009551 Sheynblat Dec 1999 A
6011509 Dutka Jan 2000 A
6014101 Loomis Jan 2000 A
6016119 Krasner Jan 2000 A
6041222 Horton et al. Mar 2000 A
6044418 Muller Mar 2000 A
6047017 Cahn et al. Apr 2000 A
6052081 Krasner Apr 2000 A
6061018 Sheynblat May 2000 A
6064336 Krasner May 2000 A
6104338 Krasner Aug 2000 A
6104340 Krasner Aug 2000 A
6107960 Krasner Aug 2000 A
6111540 Krasner Aug 2000 A
6125430 Noel et al. Sep 2000 A
6131067 Girerd et al. Oct 2000 A
6133871 Krasner Oct 2000 A
6133873 Krasner Oct 2000 A
6133874 Krasner Oct 2000 A
6150980 Krasner Nov 2000 A
6182089 Ganapathy et al. Jan 2001 B1
6205400 Lin Mar 2001 B1
6211822 Dougherty et al. Apr 2001 B1
6278404 Niles Aug 2001 B1
6526322 Peng et al. Feb 2003 B1
Foreign Referenced Citations (6)
Number Date Country
0511741 Nov 1992 EP
2115195 Jan 1983 GB
58-105632 Jun 1983 JP
7-36035 May 1986 JP
4-326079 Nov 1992 JP
WO 9011652 Oct 1990 WO
Related Publications (1)
Number Date Country
20030088741 A1 May 2003 US
Continuations (1)
Number Date Country
Parent 09465985 Dec 1999 US
Child 10309647 US