System and method for estimating the location of a mobile device

• US 8,331,953 B2
• Filed: 05/01/2007
• Issued: 12/11/2012
• Est. Priority Date: 05/01/2007
• Status: Active Grant

• Current Assignee: Bison Patent Licensing, LLC
• Original Assignee: Andrew LLC (CommScope Holding Company, Inc.)
• Inventors: Carlson, John, Alles, Martin
• Primary Examiner(s): Edouard, Patrick
• Assistant Examiner(s): Irace, Michael
• Application Number:
  US11/743,139
• Publication Number:
  US 20080274750A1
• Time in Patent Office: 2,051 Days
• Field of Search: 455/456.1, 455/456.6
• US Class Current: 455/456.1
• CPC Class Codes: G01S 5/10 Position of receiver fixed by co-ordinating a plurality of position lines defined by path-difference measurements , e.g. omega or decca systemsG01S5/12 takes precedence ; beacons and receivers cooperating therewith G01S1/306, G01S1/308
• CPC Class Codes: G01S 5/12 by co-ordinating position lines of different shape, e.g. hyperbolic, circular, elliptical or radial
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management

Abstract

A system and method for estimating the location of a mobile station that receives signals from a plurality of base stations. The base station timing offsets may be estimated utilizing an observed time difference of arrival value at the mobile between a first signal received from a first base station and a second signal received from a second base station. An initial location for the mobile is randomly selected and an estimated location is determined using the selected initial location, the observed time difference of arrival value, and an iterative search algorithm. The estimated location may be stored if the estimated location is within a predetermined area. In addition, for each such estimated location, the applicable base station time offsets that relate to this location may be updated to generate a current best estimate. A calculated location for the mobile may be determined from stored estimated locations and the current base station time offset estimates.

Claims

1. A method for estimating the location of a first mobile station from a plurality of mobile stations that receive signals from a plurality of base stations, comprising:

(a) determining observed time difference of arrival (“

OTDOA”

) values at said first mobile station and at a second mobile station between a first signal received from a first base station and a second signal received from a second base station;

(b) determining a round trip time (“

RTT”

) values between said first and second mobile stations and said first base station;

(c) selecting an initial locations for said first and second mobile stations that are within a first and second predetermined areas, respectively;

(d) determining an estimated base station time offset (“

BSTO”

) using the selected initial locations, the OTDOA and RTT values, and an iterative search algorithm wherein the iterative search algorithm iterates a predetermined number of steps;

(e) determining an estimated location for said first mobile station jointly with the BSTO;

(f) storing said estimated location if the estimated location is within a third predetermined area;

(g) repeating (a) through (f) within a predetermined time interval; and

(h) determining a calculated location for said first mobile station from the stored estimated locations.

2. The method of claim 1 wherein determining an estimated BSTO further comprises:

(i) determining a best estimate for the BSTO and updating said estimated BSTO with said best estimate;

(ii) if no best estimate exists, then setting said estimated BSTO as the best estimate.

3. The method of claim 1 wherein said first and second base stations are not synchronized.

4. The method of claim 1 wherein for each repetition of (c) the initial location is selected at random within said first predetermined area.

5. The method of claim 1 wherein said first predetermined area is coextensive with an area served by said first base station.

6. The method of claim 1 wherein said first predetermined area and said third predetermined area are the same.

7. The method of claim 1 wherein said iterative search algorithm is a gradient search algorithm.

8. The method of claim 1 wherein said predetermined time interval is a function of a base station time offset drift value for a base station time offset between said first and second base stations.

9. The method of claim 1 wherein (a) through (f) are repeated a predetermined number of times rather than over a predetermined time interval.

10. The method of claim 1 wherein said calculated location is determined as an average of said stored estimated locations.

11. The method of claim 1 wherein said calculated location is determined using a measure of central tendency.

12. The method of claim 1 wherein said calculated location is determined using a mathematical process selected from the group consisting of:

average, weighted average, median, mode, midrange, and mean.

13. The method of claim 1 wherein said mobile station is selected from the group consisting of:

cellular telephone, text messaging device, computer, portable computer, vehicle locating device, vehicle security device, communication device, and wireless transceiver.

14. A method for estimating the location of a first mobile station and a second mobile station where each mobile station receives signals from the same plurality of base stations, comprising:

(a) determining a first observed time difference of arrival (“

OTDOA1”

) value at said first mobile station between a first signal received from a first base station and a second signal received from a second base station;

(b) determining a second observed time difference of arrival (“

OTDOA2”

) value at said second mobile station between a third signal received from said first base station and a fourth signal received from said second base station;

(c) determining a first round trip time (“

RTT1”

) value between said first mobile station and said first base station;

(d) determining a second round trip time (“

RTT2”

) value between said second mobile station and said second base station;

(e) selecting a first initial location for said first mobile station that is within a first predetermined area;

(f) selecting a second initial location for said second mobile station that is within a second predetermined area;

(g) determining an estimated base station time offset (“

BSTO”

) using the selected initial locations, the OTDOA1 value, the OTDOA2 value, the RTT1 value, the RTT2 value, and an iterative search algorithm wherein the iterative search algorithm iterates a predetermined number of steps;

(h) determining a first estimated location for said first mobile station and a second estimated location for said second mobile station jointly with the BSTO;

(i) storing the first estimated location if said first estimated location is within a third predetermined area;

(j) storing the second estimated location if said second estimated location is within a fourth predetermined area;

(k) repeating (a) through (j) within a predetermined time interval; and

(l) determining a first calculated location for said first mobile station and a second calculated location for said second mobile station from the stored estimated locations.

15. The method of claim 14 wherein determining an estimated BSTO further comprises:

(i) determining a best estimate for the BSTO and updating said estimated BSTO with said best estimate;

(ii) if no best estimate exists, then setting said estimated BSTO as the best estimate.

16. The method of claim 14 wherein said first and second base stations are not synchronized.

17. The method of claim 14 wherein for each repetition of (e) the initial location of said first mobile station is selected at random within said first predetermined area.

18. The method of claim 14 wherein for each repetition of (f) the initial location of said second mobile station is selected at random within said second predetermined area.

19. The method of claim 14 wherein said first predetermined area is coextensive with an area served by said first base station.

20. The method of claim 14 wherein said second predetermined area is coextensive with an area served by said second base station.

21. The method of claim 14 wherein said first predetermined area and said third predetermined area are the same.

22. The method of claim 14 wherein said second predetermined area and said fourth predetermined area are the same.

23. The method of claim 14 wherein said iterative search algorithm is a gradient search algorithm.

24. The method of claim 14 wherein said predetermined time interval is a function of a base station time offset drift value for a base station time offset between said first and second base stations.

25. The method of claim 14 wherein (a) through (j) are repeated a predetermined number of times rather than over a predetermined time interval.

26. The method of claim 14 wherein at least one of said first calculated location is determined as an average of said stored first estimated locations.

27. The method of claim 14 wherein said second calculated location is determined as an average of said stored second estimated locations.

28. The method of claim 14 wherein at least one of said first calculated location and said second calculated location is determined using a measure of central tendency.

29. The method of claim 14 wherein at least one of said first calculated location and said second calculated location is determined using a mathematical process selected from the group consisting of:

average, weighted average, median, mode, midrange, and mean.

30. The method of claim 14 wherein at least one of said first mobile station and said second mobile station is selected from the group consisting of:

cellular telephone, text messaging device, computer, portable computer, vehicle locating device, vehicle security device, communication device, and wireless transceiver.

31. A method for estimating the location of a first mobile station and a second mobile station where each mobile station receives signals from the same plurality of base stations, comprising:

(a) determining a first observed time difference of arrival (“

OTDOA1”

) value at said first mobile station between a first signal received from a first base station and a second signal received from a second base station;

(b) determining a second observed time difference of arrival (“

OTDOA2”

) value at said second mobile station between a third signal received from said first base station and a fourth signal received from said second base station;

(c) selecting a first initial location for said first mobile station that is within a first predetermined area;

(d) selecting a second initial location for said second mobile station that is within a second predetermined area;

(e) determining an estimated base station time offset (“

BSTO”

) using the selected initial locations, the OTDOA1 value, the OTDOA2 value, and an iterative search algorithm wherein the iterative search algorithm iterates a predetermined number of steps;

(f) determining a first estimated location for said first mobile station and a second estimated location for said second mobile station jointly with the BSTO;

(g) storing the first estimated location if said first estimated location is within a third predetermined area;

(h) storing the second estimated location if said second estimated location is within a fourth predetermined area;

(i) repeating (a) through (h) within a predetermined time interval; and

(j) determining a first calculated location for said first mobile station and a second calculated location for said second mobile station from the stored estimated locations.

32. The method of claim 31 wherein determining an estimated BSTO further comprises:

(i) determining a best estimate for the BSTO and updating said estimated BSTO with said best estimate;

(ii) if no best estimate exists, then setting said estimated BSTO as the best estimate.

33. The method of claim 31 wherein said first and second base stations are not synchronized.

34. The method of claim 31 wherein for each repetition of (c) the initial location of said first mobile station is selected at random within said first predetermined area.

35. The method of claim 31 wherein for each repetition of (d) the initial location of said second mobile station is selected at random within said second predetermined area.

36. The method of claim 31 wherein said first predetermined area is coextensive with an area served by said first base station.

37. The method of claim 31 wherein said second predetermined area is coextensive with an area served by said second base station.

38. The method of claim 31 wherein said first predetermined area and said third predetermined area are the same.

39. The method of claim 31 wherein said second predetermined area and said fourth predetermined area are the same.

40. The method of claim 31 wherein said iterative search algorithm is a gradient search algorithm.

41. The method of claim 31 wherein said predetermined time interval is a function of a base station time offset drift value for a base station time offset between said first and second base stations.

42. The method of claim 31 wherein (a) through (h) are repeated a predetermined number of times rather than over a predetermined time interval.

43. The method of claim 31 wherein at least one of said first calculated location is determined as an average of said stored first estimated locations.

44. The method of claim 31 wherein said second calculated location is determined as an average of said stored second estimated locations.

45. The method of claim 31 wherein at least one of said first calculated location and said second calculated location is determined using a measure of central tendency.

46. The method of claim 31 wherein at least one of said first calculated location and said second calculated location is determined using a mathematical process selected from the group consisting of:

average, weighted average, median, mode, midrange, and mean.

47. The method of claim 31 wherein at least one of said first mobile station and said second mobile station is selected from the group consisting of:

cellular telephone, text messaging device, computer, portable computer, vehicle locating device, vehicle security device, communication device, and wireless transceiver.