The present invention relates generally to single-frequency networks. More particularly, the present invention relates to blind identification of single-frequency-network transmitters.
In many conventional broadcast transmission systems, a transmitter can be identified based on the signal it transmits. For example, in a frequency-division multiple access (FDMA) broadcast television (TV) network, individual TV channels can be identified by their transmit frequencies, and linked to their corresponding points of broadcast.
In contrast, single-frequency networks (SFN) transmit virtually identical signals from multiple points of transmission. Broadcasts from the various transmitters are generally synchronized, for example by GPS, to within tens of nanoseconds. While this type of macro-scale diversity has shown great merit in combating fading, in terms of positioning this method poses a significant problem in that an SFN signal does not identify its transmitter.
In general, in one aspect, the invention features an apparatus comprising: an input module adapted to receive a plurality of pseudoranges each determined by a receiver based on one of a plurality of wireless single-frequency network (SFN) signals transmitted at a predetermined frequency from a corresponding plurality of transmitters; and a transmitter identification module adapted to identify one of the transmitters for each of the pseudoranges based on the pseudoranges and a plurality of ranges each predetermined between one of the transmitters and one of a plurality of predetermined geographic locations.
In some embodiments, the transmitter identification module comprises: an error module adapted to generate an error for each of the geographic locations based on the ranges for the respective geographic locations and the pseudoranges; wherein the transmitter identification module identifies the transmitters based on the errors. Some embodiments comprise a location module adapted to determine a location of the receiver based on locations of the transmitters identified by the transmitter identification module and the pseudoranges. In some embodiments, the transmitter identification module selects a subset of the predetermined geographic locations based on one or more non-SFN signals received by the receiver; and the transmitter identification module identifies the transmitters based on the pseudoranges, the subset of the predetermined geographic locations, and the ranges corresponding to the subset of the predetermined geographic locations. Some embodiments comprise the receiver.
In general, in one aspect, the invention features an apparatus comprising: input means for receiving a plurality of pseudoranges each determined by a receiver based on one of a plurality of wireless single-frequency network (SFN) signals transmitted at a predetermined frequency from a corresponding plurality of transmitters; and transmitter identification means for identifying one of the transmitters for each of the pseudoranges based on the pseudoranges and a plurality of ranges each predetermined between one of the transmitters and one of a plurality of predetermined geographic locations.
In some embodiments, the transmitter identification means comprises: error means for generating an error for each of the geographic locations based on the ranges for the respective geographic locations and the pseudoranges; wherein the transmitter identification means identifies the transmitters based on the errors. Some embodiments comprise location means for determining a location of the receiver based on locations of the transmitters identified by the transmitter identification means and the pseudoranges. In some embodiments, the transmitter identification means selects a subset of the predetermined geographic locations based on one or more non-SFN signals received by the receiver; and the transmitter identification means identifies the transmitters based on the pseudoranges, the subset of the predetermined geographic locations, and the ranges corresponding to the subset of the predetermined geographic locations. Some embodiments comprise the receiver.
In general, in one aspect, the invention features a method comprising: receiving a plurality of pseudoranges each determined by a receiver based on one of a plurality of wireless single-frequency network (SFN) signals transmitted at a predetermined frequency from a corresponding plurality of transmitters; and identifying one of the transmitters for each of the pseudoranges based on the pseudoranges and a plurality of ranges each predetermined between one of the transmitters and one of a plurality of predetermined geographic locations.
Some embodiments comprise generating an error for each of the geographic locations based on the ranges for the respective geographic locations and the pseudoranges; wherein the transmitters are identified based on the errors. Some embodiments comprise determining a location of the receiver based on locations of the transmitters and the pseudoranges. Some embodiments comprise selecting a subset of the predetermined geographic locations based on one or more non-SFN signals received by the receiver; and identifying the transmitters based on the pseudoranges, the subset of the predetermined geographic locations, and the ranges corresponding to the subset of the predetermined geographic locations. Some embodiments comprise receiving the wireless SFN signals.
In general, in one aspect, the invention features computer-readable media embodying instructions executable by a computer to perform a method comprising: receiving a plurality of pseudoranges each determined by a receiver based on one of a plurality of wireless single-frequency network (SFN) signals transmitted at a predetermined frequency from a corresponding plurality of transmitters; and identifying one of the transmitters for each of the pseudoranges based on the pseudoranges and a plurality of ranges each predetermined between one of the transmitters and one of a plurality of predetermined geographic locations.
In some embodiments, the method further comprises: generating an error for each of the geographic locations based on the ranges for the respective geographic locations and the pseudoranges; wherein the transmitters are identified based on the errors. In some embodiments, the method further comprises: determining a location of the receiver based on locations of the transmitters and the pseudoranges. In some embodiments, the method further comprises: selecting a subset of the predetermined geographic locations based on one or more non-SFN signals received by the receiver; and identifying the transmitters based on the pseudoranges, the subset of the predetermined geographic locations, and the ranges corresponding to the subset of the predetermined geographic locations. In some embodiments, the method further comprises: receiving the wireless SFN signals.
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and from the claims.
The leading digit(s) of each reference numeral used in this specification indicates the number of the drawing in which the reference numeral first appears.
As used herein, the terms “client” and “server” generally refer to an electronic device or mechanism, and the term “message” generally refers to an electronic signal representing a digital message. As used herein, the term “mechanism” refers to hardware, software, or any combination thereof. These terms are used to simplify the description that follows. The clients, servers, and mechanisms described herein can be implemented on any standard general-purpose computer, or can be implemented as specialized devices.
Embodiments of the present invention provide blind identification of single-frequency-network (SFN) transmitters. Various embodiments include an input module adapted to receive a plurality of pseudoranges each determined by a receiver based on one of a plurality of wireless SFN signals transmitted at a predetermined frequency from a corresponding plurality of transmitters, and a transmitter identification module adapted to identify one of the transmitters for each of the pseudoranges based on the pseudoranges and a plurality of ranges each predetermined between one of the transmitters and one of a plurality of predetermined geographic locations, also referred to herein as “survey points.” Some embodiments include a location module adapted to determine a location of the receiver based on locations of the transmitters identified by the transmitter identification module and the pseudoranges.
The phrase “user terminal” is meant to refer to any object capable of implementing the techniques described herein. Examples of user terminals include PDAs, mobile phones, cars and other vehicles, and any object which could include a chip or software implementing the techniques described herein. Further, the term “user terminal” is not intended to be limited to objects which are “terminals” or which are operated by “users.”
In some embodiments, user terminal 102 performs the techniques described herein. In other embodiments, some or all of the techniques are performed by a location server 106 based on data collected by user terminal 102 and relayed by a relay station 108 such as a cellular base station and the like. The locations of SFN transmitters 104 can be stored in a SFN transmitter location database 112. The location of user terminal 102 can be transmitted to an E911 location server 116 for emergencies.
Referring to
Referring to
Pseudorange module 208 generates a pseudorange for each of the correlation peaks (step 306). Input module 210 receives the pseudoranges from pseudorange module 208. Transmitter identification module 212 matches SFN transmitters 104 with the pseudoranges (step 308). That is, for each pseudorange, transmitter identification module 212 identifies the SFN transmitter 104 that transmitted the SFN signal used by apparatus 200 to produce the pseudorange, as described in detail below. After the pseudoranges and transmitters have been matched, location module 214 can determine the location of user terminal 102 based on the pseudoranges and transmitter locations (step 310).
Process 400 employs predetermined ranges between a plurality of predetermined survey points and SFN transmitters 104. The survey points can be selected according to any technique. For example, the survey points can be points in a grid, although any arrangement can be used.
The ranges between the selected survey points and SFN transmitters can be determined by any technique, for example such as conventional survey techniques. Each range can be a measure of the time required for an SFN signal 110 to travel from a given SFN transmitter 104 to a given survey point. The ranges can be stored for each survey point with transmitter identifiers, for example as shown in Table 1.
Referring to
In some embodiments, transmitter identification module 212 reduces the search space by selecting a subset of the predetermined survey points based on one or more non-SFN signals received by receiver 202 (step 406). For example, when user terminal 102 is implemented as a mobile telephone, transmitter identification module 212 can select the subset of the survey points that fall within the cell within which the mobile telephone is currently located.
Next, for each of the survey points used, error module 216 of transmitter identification module 212 generates an error for each of the survey points based on the sorted and de-biased pseudoranges and the sorted and de-biased ranges for that survey point (step 408). In some embodiments, the error for each survey point is calculated as a sum of squared errors (SSE) between the pseudoranges and the ranges for that survey point, as shown in equation (1).
where each {circumflex over (τ)} is a pseudorange determined by pseudorange module 208 based on one of SFN signals 110, each d is a range predetermined between the survey point and an SFN transmitter 104, N is the number of measurements, and the subscript s is an index of the survey points.
Transmitter identification module 212 selects one or more of the survey points based on the error values (step 410). For example, in some embodiments, transmitter identification module 212 simply selects the survey point with the lowest SSE. In other embodiments, transmitter identification module 212 selects multiple survey points with low SSE.
Based on the selected survey point(s), transmitter identification module 212 associates one of SFN transmitters 104 with each of the pseudoranges (step 412). For example, in the case of a single survey point, transmitter identification module 212 matches the pseudoranges with the ranges predetermined for the selected survey point based on their magnitudes. That is, each pseudorange is matched with the range having the value closest to that of the pseudorange. The pseudorange is then associated with the SFN transmitter 104 associated with the matched range, for example using a table such as Table 1 above. Once the pseudoranges are associated with SFN transmitters 104, location module 214 can determine a location of receiver 202 based on the locations of SFN transmitters 104 and the associated pseudoranges (step 414). Receiver position can also be inferred directly from equation (1), because it is likely the receiver is in the location with the lowest SSE.
Other non-SFN radio signals can be used to constrain the search space for process 400 of
{circumflex over (τ)}u,GPS(j)=du,GPS(j)+B(j)−bu,GPS+Iu,GPS(j)+Tu,GPS(j)+υu,GPS(j)
{circumflex over (τ)}u,GPS(k)=du,GPS(k)+B(k)−bu,GPS+Iu,GPS(k)+Tu,GPS(k)+υu,GPS(k) (2)
where {circumflex over (τ)} is pseudorange, d is true range, B is GPS clock bias, b is user clock bias, I is ionospheric delay, T is tropospheric delay and υ is noise. After calibrating out the GPS clock bias, the ionospheric and tropospheric delays, a TDOA representation of the equations (2) reads:
{circumflex over (τ)}u,GPS(k)−{circumflex over (τ)}u,GPS(j)=du,GPS(k)−du,GPS(j)+υu,GPS(k)−υu,GPS(j) (3)
Equation (3) sets up a constraint region in the space between two hyperboloids, where the base-line thickness corresponds to the measurement uncertainty of the TDOA measurement. The resulting search space is the intersection of the original search space with the hyperboloid slice. Hybrid ranging measurements can be included in the SSE calculation of equation (1) in the following way:
The techniques described above for SFN transmitter identification can be validated using the statistical tools described below. Equation (5) is a generalized navigation equation.
τu(i)=du(i)+αu(i)+βu(i) (5)
Where:
τ is the measured quantity
d is the true quantity, for example range
α is a random error ˜N(0,σ2)
β is a bias
The sum of squared errors (SSE) from equation 5 is given by equation (6).
Equation (7) gives the probability that the SSE at the true location (that is, the actual location of user terminal 102) is larger than that at a test point (that is, a survey point) in the search space. A small probability indicates that there is a small probability that ambiguous “truth” positions exist.
All α's are assumed to be independent of each other and identically Gaussian distributed N(0,σ2). β's are residuals between the arrivals at the true location and the arrivals at the test points in the search grid. Equation (8) breaks out and re-names the left-hand terms inside the probability in equation (7).
While X and Y in equation (8) are Chi-square distributed, Z is normal distributed. The right-hand term inside the probability of equation (4) is identified as a constant.
The set of variables {X,Y,Z} can be re-arranged into another set of variables {V,W,X}.
W=X−Y−Z
V=Y+Z
W=X−V (9)
Using equations (7)-(9) yields:
From equation (10) and the definition of conditional probability, it follows that
FV is the cumulative distribution function (CDF) of the random variable V. This CDF can be found as a function of the CDF and probability density function (PDF) of random variables Y and Z from a similar deduction to the one of equation (11). fX is the PDF of the random variable X.
Combining equations (10) and (11) yields
While there may be no analytical solution to the integral of equation (11), the probability of equation (9) can be calculated numerically with knowledge of PDFs and CDFs of Gaussian and Chi-square distributions.
Note that the above method makes no distinction between SFN measurements and other navigation measurements. As long as the fundamental measurement adheres to the format of equation (5), any hybrid measurement source may be used.
Embodiments of the invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Apparatus of the invention can be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method steps of the invention can be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output. The invention can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program can be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language can be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Generally, a computer will include one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).
A number of implementations of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other implementations are within the scope of the following claims.
This application claims benefit of U.S. Provisional Patent Application Ser. No. 60/866,886 filed Nov. 22, 2006, the disclosure of which is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4555707 | Connelly | Nov 1985 | A |
4652884 | Starker | Mar 1987 | A |
4700306 | Wallmander | Oct 1987 | A |
4894662 | Counselman | Jan 1990 | A |
5045861 | Duffett-Smith | Sep 1991 | A |
5157686 | Omura et al. | Oct 1992 | A |
5166952 | Omura et al. | Nov 1992 | A |
5271034 | Abaunza | Dec 1993 | A |
5323322 | Mueller et al. | Jun 1994 | A |
5398034 | Spilker, Jr. | Mar 1995 | A |
5481316 | Patel | Jan 1996 | A |
5504492 | Class et al. | Apr 1996 | A |
5510801 | Engelbrecht et al. | Apr 1996 | A |
5604765 | Bruno et al. | Feb 1997 | A |
5630206 | Urban et al. | May 1997 | A |
5648982 | Durrant et al. | Jul 1997 | A |
5774829 | Cisneros et al. | Jun 1998 | A |
5784339 | Woodsum et al. | Jul 1998 | A |
5835060 | Czarnecki et al. | Nov 1998 | A |
5920284 | Victor | Jul 1999 | A |
5952958 | Speasl et al. | Sep 1999 | A |
5953311 | Davies et al. | Sep 1999 | A |
6006097 | Hornfeldt et al. | Dec 1999 | A |
6016119 | Krasner | Jan 2000 | A |
6078284 | Levanon | Jun 2000 | A |
6094168 | Duffett-Smith et al. | Jul 2000 | A |
6107959 | Levanon | Aug 2000 | A |
6137441 | Dai et al. | Oct 2000 | A |
6144413 | Zatsman | Nov 2000 | A |
6147642 | Perry et al. | Nov 2000 | A |
6181921 | Konisi et al. | Jan 2001 | B1 |
6184921 | Limberg | Feb 2001 | B1 |
6201497 | Snyder et al. | Mar 2001 | B1 |
6215778 | Lomp et al. | Apr 2001 | B1 |
6289280 | Fernandez-Corbaton et al. | Sep 2001 | B1 |
6317452 | Durrant et al. | Nov 2001 | B1 |
6317500 | Murphy | Nov 2001 | B1 |
6373432 | Rabinowitz et al. | Apr 2002 | B1 |
6374177 | Lee et al. | Apr 2002 | B1 |
6400753 | Kohli et al. | Jun 2002 | B1 |
6433740 | Gilhousen | Aug 2002 | B1 |
6437832 | Grabb et al. | Aug 2002 | B1 |
6484034 | Tsunehara et al. | Nov 2002 | B1 |
6522297 | Rabinowitz et al. | Feb 2003 | B1 |
6559800 | Rabinowitz et al. | May 2003 | B2 |
6559894 | Omura et al. | May 2003 | B2 |
6590529 | Schwoegler | Jul 2003 | B2 |
6646603 | Dooley et al. | Nov 2003 | B2 |
6717547 | Spilker, Jr. et al. | Apr 2004 | B2 |
6727847 | Rabinowitz et al. | Apr 2004 | B2 |
6753812 | Rabinowitz et al. | Jun 2004 | B2 |
6806830 | Panasik et al. | Oct 2004 | B2 |
6839024 | Spilker, Jr. et al. | Jan 2005 | B2 |
6859173 | Spilker, Jr. et al. | Feb 2005 | B2 |
6861984 | Rabinowitz et al. | Mar 2005 | B2 |
6879286 | Rabinowitz et al. | Apr 2005 | B2 |
6914560 | Spilker, Jr. et al. | Jul 2005 | B2 |
6917328 | Rabinowitz et al. | Jul 2005 | B2 |
6937866 | Duffett-Smith et al. | Aug 2005 | B2 |
6952182 | Spilker, Jr. et al. | Oct 2005 | B2 |
6961020 | Robinowitz et al. | Nov 2005 | B2 |
6963306 | Spilker, Jr. et al. | Nov 2005 | B2 |
6970132 | Spilker, Jr. et al. | Nov 2005 | B2 |
7042396 | Omura et al. | May 2006 | B2 |
7042949 | Omura et al. | May 2006 | B1 |
7126536 | Rabinowitz et al. | Oct 2006 | B2 |
7260378 | Holland et al. | Aug 2007 | B2 |
7269424 | Camp, Jr. | Sep 2007 | B2 |
7372405 | Rabinowitz et al. | May 2008 | B2 |
7463195 | Rabinowitz et al. | Dec 2008 | B2 |
20020122003 | Patwari et al. | Sep 2002 | A1 |
20020184653 | Pierce et al. | Dec 2002 | A1 |
20020199196 | Rabinowitz et al. | Dec 2002 | A1 |
20030162547 | McNair | Aug 2003 | A1 |
20040073914 | Spilker et al. | Apr 2004 | A1 |
20040157622 | Needham | Aug 2004 | A1 |
20040201779 | Spilker et al. | Oct 2004 | A1 |
20050066373 | Rabinowitz et al. | Mar 2005 | A1 |
20050251844 | Martone et al. | Nov 2005 | A1 |
20070050824 | Lee et al. | Mar 2007 | A1 |
20070109184 | Shyr et al. | May 2007 | A1 |
20070121555 | Burgess et al. | May 2007 | A1 |
20070131079 | Opshaug et al. | Jun 2007 | A1 |
20070182633 | Omura et al. | Aug 2007 | A1 |
20070296632 | Opshaug et al. | Dec 2007 | A1 |
Number | Date | Country |
---|---|---|
3242997 | May 1984 | DE |
58129277 | Aug 1983 | EP |
2 222 922 | Mar 1990 | GB |
2 254 508 | Oct 1992 | GB |
Entry |
---|
Parkinson, B.W., et al., “Autonomous GPS Integrity Monitoring Using the Pseudorange Residual,” Journal of the Institute of Navigation (1988), vol. 35, No. 2, pp. 255-274. |
Rabinowitz, M., “A Differential Carrier Phase Navigation System Combining GPS with Low Earth Orbit Satellites for Rapid Resolution of Integer Cycle Ambiguities,” PhD Thesis for Department of Electrical Engineering, Stanford University (Dec. 2000), pp. 59-73. |
Spilker, Jr., J.J., “Fundamentals of Signal Tracking Theory,” Global Positioning System: Theory and Applications (1994), vol. 1, Chapter 7, pp. 245-327. |
Van Dierendock, A.J., “GPS Receivers,” Global Positioning System: Theory and Applications (1995), vol. 1, Chapter 8, pp. 329-407. |
Li, X., et al., “Indoor Geolocation Using OFDM Signals in HIPERLAN/2 Wireless LANS,” 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications, PIMRC 2000, Proceedings (Cat. No. 00TH8525), Proceedings of 11th International Symposium on Personal Indoor and Mobile Radio Communication, London, UK, Sep. 18-21, pp. 1449-1453, vol. 2, XPO10520871, 2000, Piscataway, NJ, USA, IEEE, USA, ISBN; 9-7803-6463-5, Chapter I and III. |
Rabinowitz, M., et al., “Positioning Using the ATSC Digital Television Signal,” Rosum whitepaper, Online! 2001, XP002235053, Retrieved from the Internet on Mar. 13, 2003 at URL www.rosum.com/whitepaper 8-7-01.pdf. |
U.S. Appl. No. 12/476,992, Do, et al. |
U.S. Appl. No. 12/209,971, filed Sep. 12, 2008, Do, et al. |
U.S. Appl. No. 12/333,445, filed Dec. 12, 2008, Rubin, et al. |
U.S. Appl. No. 12/351,841, filed Jan. 11, 2009, Lee, et al. |
U.S. Appl. No. 12/263,731, Rabinowitz, et al. |
U.S. Appl. No. 10/008,613, Pierce, et al. |
U.S. Appl. No. 11/380,691, Metzler, et al. |
U.S. Appl. No. 11/535,485, Furman, et al. |
U.S. Appl. No. 11/622,838, Rabinowitz, et al. |
U.S. Appl. No. 11/770,162, Furman, et al. |
U.S. Appl. No. 12/117,676, Rabinowitz, et al. |
U.S. Appl. No. 12/168,141, Furman, et al. |
Number | Date | Country | |
---|---|---|---|
60866886 | Nov 2006 | US |