Optimum utilization of pseudorange and range rate corrections by SATPS receiver

• US 6,009,551 A
• Filed: 03/03/1998
• Issued: 12/28/1999
• Est. Priority Date: 05/05/1995
• Status: Expired due to Term

• Current Assignee: Trimble Navigation Limited (Trimble Inc.)
• Original Assignee: Trimble Navigation Limited (Trimble Inc.)
• Inventors: Sheynblat, Len
• Primary Examiner(s): Baker, Stephen M.
• Application Number:
  US09/033,887
• Time in Patent Office: 665 Days
• Field of Search: 714/798, 714/800, 714/776
• US Class Current: 714/776
• CPC Class Codes: G01S 19/41 Differential correction, e.g. DGPS [differential GPS]

Abstract

The partial decoding algorithm for decoding the partially damaged differential satellite positioning system (SATPS) messages is disclosed. The algorithm is based on the modified parity test. The information included in the decoded messages can be used for the high level differential SATPS testing.

Claims

1. A method of recovering data included in a damaged differential correction message using a partial decode algorithm, said method comprising the steps of:

locking on a current differential correction message;

testing said current message by using a plurality of standard parity tests and a modified parity test;

and

utlilizing said testing information at the higher level integrity testing of said current differential correction message.

2. The method of claim 1, wherein said step of locking on said current differential correction message further comprises the step of:

locking on a first header word of said current differential correction message.

3. The method of claim 1, wherein said step of locking on said current differential correction message further comprises the steps of:

matching a PREAMBLE field in the data stream with a PREAMBLE data included in the user receiver;

checking said first header word of said current differential correction message for an initial parity test if said PREAMBLE field in the data stream matches said PREAMBLE data included in the user receiver;

checking said first header word of said current differential correction message for a station ID if said first header word does not pass the initial parity test;

checking a second header word of said current differential correction message for the initial parity test if the station ID included in the message matches the station ID included in the user receiver; and

acquiring the lock if said second header word passes the initial parity test and if the station ID included in the message header matches with the station ID included in the user receiver.

4. The method of claim 1, wherein said step of testing said current message by using said plurality of standard parity tests and said modified parity further comprises the steps of:

checking whether the first header word passes the parity check using an initial parity test;

testing the second header word using the standard parity test if the first header word passes the initial parity test;

testing the parity of each data word following the PDA data word using the standard parity test if the second header word passes the standard parity test;

recording said data word as the PDA data word if said data word passes the standard parity test;

recording said data word as a non-PDA data word if said data word does not pass the standard parity test;

testing the parity of a current data word that immediately follows the non-PDA data word using a modified parity test; and

starting the resynchronization process if the last word in the frame as defined by the length of frame field in the second header word fails the standard test or the modified test depending on whether the preceding data word was the PDA data word or the non-PDA data word.

5. The method of claim 1, wherein said step of testing said current message by using said plurality of standard parity tests and said modified parity test further comprises the steps of:

proceeding with a data word immediately following a non-PDA data word if the non-PDA data word is the last word in the frame, wherein said data word immediately following the last non-PDA data word in the frame is the first header word of the next message frame;

counting the number of consecutive non-PDA data words; and

resetting the algorithm and starting the resynchronization process again once the number of consecutive non-PDA data words exceeds some predetermined threshold.

6. The method of claim 4, wherein said message comprises a plurality of 30-bit words numbered 1, 2, . . . M, (M is an integer), and wherein each said 30-bit word includes d1, d2, . . . d24, d25, d26, . . . d29, d30 bits, and wherein the bits d25 through d30 are the parity bits, and wherein the bits d29* and d30* indicate the last two parity bits of the previous word, and wherein said step of checking whether the first header word passes the parity check using the initial parity test further comprises the steps of:

assuming that d29* and d30* bits are both zeroes, making the direct comparison of d1 through d8 bits to the PREAMBLE stored in the user receiver;

setting d30* to a one, inverting data bits d1 through d8, inverting the stored in the user receiver PREAMBLE, and making the inverted comparison of the inverted data bits d1 through d8 to the inverted PREAMBLE if the direct comparison fails;

computing the checksum based on d29*, d30* and d1 through d24 if either direct or inverted comparison does not fail;

matching the checksum with the parity bits included in the bits d25 through d30;

recomputing the checksum by setting d29* to a one if the match based on d29*, d30* and d1 through d24 is not found; and

checking the recomputed checksum for the match again.

7. The method of claim 4, wherein said message comprises a plurality of 30-bit words numbered 1, 2, . . . M, (M is an integer), and wherein each said 30-bit word includes d1, d2, . . . d24, d25, d26, . . . d29, d30 bits, and wherein the bits d25 through d30 are the parity bits, and wherein the bits d29* and d30* indicate the last two parity bits of the previous word, and wherein said step of testing the parity of each said data word following the PDA data word using the standard parity test further comprises the steps of:

computing the checksum based on d29*, d30* and d1 through d24;

checking the checksum for the match with the parity bits included in the bits d25 through d30;

assigning the PDA information to each said data word if there is a match; and

assigning the non-PDA information to each said data word if there is no match.

8. The method of claim 4, wherein each said message comprises a plurality of 30-bit words numbered 1, 2, . . . M, (M is an integer), and wherein each said 30-bit word includes d1, d2, . . . d24, d25, d26, . . . d29, d30 bits, and wherein the bits d25 through d30 are the parity bits, and wherein the bits d29* and d30* indicate the last two parity bits of the previous word, and wherein said step of testing the parity of the current data word that immediately follows the non-PDA word using the modified parity test further comprises the steps of:

(a) modifying the non-PDA word by changing the last two bits of the non-PDA word, wherein the last two bits of the non-PDA word have four different sates, wherein the first state is a "0" state for the last but one bit d29*; and

a "0" state for the last bit d30*, and wherein the second state is a "0" state for the last but one bit d29*, and a "1" state for the last bit d30*, and wherein the third state is a "1" state for the last but one bit d29*, and a "0" state for the last bit d30*, and wherein the fourth state is a "1" state for the last but one bit d29*, and a "1" state for the last bit d30*;

(b) computing for the first state of the non-PDA word the checksum based on d29* and d30* and d1 through d24;

(c) matching the checksum with the parity bits d25 through d30 for the first state of the non-PDA word;

(d) repeating the steps (b-c) for the second state of the non-PDA word if there is no match for the first state of the non-PDA word;

(e) repeating the steps (b-c) for the third state of the non-PDA word if there is no match for the second state of the non-PDA word;

(f) repeating the steps (b-c) for the fourth state of the non-PDA word if there is no match for the third state of the non-PDA WORD; and

(g) assigning the PDA information to the non-PDA word if for any of four states of the non-PDA WORD there is a match.