← Back to Patent Explorer
US5058200A Expired / Lapsed US ⏱️ 0.0 years remaining

Transmitter location searching system

Assignee: Lockheed Martin Corp
•
Filing: 1990-06-04
•
Granted: 1991-10-15
•
Expires: 2010-06-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A transmitter location searching system produces fast, stable and accurate results in a multipath transmission environment by geometrically partitioning the monitored area into a plurality of cells and finding the optima of a total cost function at the centers of the cells. The original three-dimensional optimization problem is thus reduced to a one-dimensional problem. Based on this calculation, the cell providing the smallest cost is chosen as a new candidate cell which is divided into smaller cells and the minimum costs are calculated for each of these smaller cells. The cell that provides the smallest cost is chosen as the center of another new candidate cell. The process is iterated until a dimension of a new candidate cell is smaller than a predetermined threshold. By reducing the dimensions of each cell by a factor of two at each iteration, the algorithm converges rapidly.

Inventors

  • 👤 Chia-Chi Huang
  • 👤 Charles M. Puckette

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 14:57
CPC Classifications
G; G01; G01S; G01S5/00; G01S5/02; G01S5/06; G01S5/0205; G01S5/0221; G01S5/02213; G01S5/02216; G01S5/14; H; H04; H04W; H04W64/00

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 129 words
A transmitter location searching method useable in a multipath transmission environment, comprising the steps of: (a) geometrically partitioning a monitored area into a plurality of cells; (b) receiving at the base stations a burst transmission from a transmitter to be located; (c) determining minima of a total cost function at the center of each cell in response to receipt of said burst transmission; (d) choosing the cell with the smallest of the plurality of total cost functions as a new candidate cell for locating said transmitter; (e) dividing the new candidate cell into smaller cells; (f) determining minimum costs for each corner of the smaller cells; and (g) iterating the process of steps (c)-(f) until a dimension of a new candidate cell is smaller than a selected geometric threshold.
Claim 2
Dependent Claim 129 words
A transmitter location searching method useable in a multipath transmission environment, comprising the steps of: (a) geometrically partitioning a monitored area into a plurality of cells; (b) receiving at the base stations a burst transmission from a transmitter to be located; (c) determining minima of a total cost function at the center of each cell in response to receipt of said burst transmission; (d) choosing the cell with the smallest of the plurality of total cost functions as a new candidate cell for locating said transmitter; (e) dividing the new candidate cell into smaller cells; (f) determining minimum costs for each corner of the smaller cells; and (g) iterating the process of steps (c)-(f) until a dimension of a new candidate cell is smaller than a selected geometric threshold.
Claim 3
Dependent Claim 22 words
The method according to claim 1 wherein the dimensions of the cells are reduced by a factor of two at each iteration.
Claim 4
Dependent Claim 94 words
The method according to claim 1 wherein the step of determining minima (t opt ) of a total cost function comprises solving the following equation: ##EQU11## where x j and y j , are either coordinates of the center of each initial cell or coordinates of each corner of divided smaller cells, x 1 and y i are the coordinates of the i'th base station, w i is a weighting factor, t i is the measured signal arrival time at the i'th base station from said transmitter, and c is the speed of light.
Claim 5
Dependent Claim 53 words
The method according to claim 3 wherein the step of determining minimum total cost F(x j ,y j ,t opt ) for the center of each of the initially-created cells and each corner of each of the divided smaller cells is performed by inserting the calculated t opt into the following equation: ##EQU12##
Claim 6
Dependent Claim 61 words
The method according to claim 1 wherein each of said base stations performs the step of determining a time of arrival of said burst transmission and further performs the step of transmitting said time of arrival to a master station to enable said master station to perform the iterated steps of geometrically partitioning a monitored area into a plurality of cells.
Claim 7
Dependent Claim 30 words
The method according to claim 5 wherein said master station also functions as a base station and performs the step of determining a time of arrival of said burst transmission.
Claim 8
Dependent Claim 216 words
A transmitter location searching system comprising: a plurality of base stations distributed over an area to be monitored, each of said base stations being adapted to receive a burst RF transmission from a transmitter within said area, the burst transmission containing information identifying the transmitter, each of said base stations further including a time of arrival subsystem responsive to a time reference and to said information for generating an output signal identifying said transmitter and a time arrival of a burst RF transmission from said transmitter; and a master station for receiving output signals from each of said base stations, said master station including ranging processor means for geometrically partitioning the monitored area into a plurality of cells based on the locations of said plurality of base stations, determining the minima of a total cost function at the centers of the cells, choosing the cell with the smallest of the plurality of total cost functions as a new candidate cell, dividing the new candidate cell into smaller cells, determining minimum costs for each corner of the smaller cells, and iterating the portion of the process beginning with determining the minima of a total cost function at the centers of the cells, until a dimension of a new candidate cell is smaller than a selected geometric threshold.
Claim 9
Dependent Claim 216 words
A transmitter location searching system comprising: a plurality of base stations distributed over an area to be monitored, each of said base stations being adapted to receive a burst RF transmission from a transmitter within said area, the burst transmission containing information identifying the transmitter, each of said base stations further including a time of arrival subsystem responsive to a time reference and to said information for generating an output signal identifying said transmitter and a time arrival of a burst RF transmission from said transmitter; and a master station for receiving output signals from each of said base stations, said master station including ranging processor means for geometrically partitioning the monitored area into a plurality of cells based on the locations of said plurality of base stations, determining the minima of a total cost function at the centers of the cells, choosing the cell with the smallest of the plurality of total cost functions as a new candidate cell, dividing the new candidate cell into smaller cells, determining minimum costs for each corner of the smaller cells, and iterating the portion of the process beginning with determining the minima of a total cost function at the centers of the cells, until a dimension of a new candidate cell is smaller than a selected geometric threshold.
Claim 10
Dependent Claim 103 words
The transmitter location searching system recited in claim 7, and further including a time epoch subsystem at each of said base stations for generating a system synchronized time signal, said time of arrival subsystem comprising: a correlator connected to receive a clock signal and a signal produced by demodulating said burst RF transmission so as to produce a correlated output signal; a threshold circuit for comparing said correlated output signal with a reference signal and producing a strobe signal if said correlated output signal exceeds said reference signal; and a time latch responsive to said strobe signal for storing said synchronized time signal.
Claim 11
Dependent Claim 30 words
The transmitter location searching system recited in claim 8 wherein said correlator comprises a tapped delay line filter having tap weights selected in accordance with the burst RF transmission waveform.
Claim 12
Dependent Claim 64 words
The transmitter location searching system recited in claim 8 wherein said ranging processor comprises: a coverage recognition data base for receiving and storing output signals from each of said base stations; a base station geographic data base for storing locations of said base stations; and an arithmetic unit coupled to said data bases for processing said stored output signals to determine said transmitter location.
Claim 13
Dependent Claim 18 words
The transmitter location searching system recited in claim 7 wherein said master station also comprises a base station.
Claim 14
Dependent Claim 34 words
The transmitter location searching system recited in claim 7 further comprising a calibration transmitter for transmitting a calibration time signal to said base stations to synchronize the time epoch subsystems of said base stations.
Claim 15
Dependent Claim 19 words
The transmitter location searching system recited in claim 12 wherein said calibration transmitter is collocated with said master station.

References Cited (Backward Citations)

US4161734A Cited
US4755761A Cited
US4864313A Cited
US4799062A Cited
US4902979A Cited
US4888557A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-10-14 1995-04-15 1995-10-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-10-14 1999-04-15 1999-10-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-10-14 2003-04-15 2003-10-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag