1987
DOI: 10.1109/tassp.1987.1165089
|View full text |Cite
|
Sign up to set email alerts
|

Closed-form least-squares source location estimation from range-difference measurements

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
290
0
6

Year Published

1998
1998
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 608 publications
(301 citation statements)
references
References 12 publications
1
290
0
6
Order By: Relevance
“…Location estimates have been formed by the exact solutions to the hyperbolic TDOA equations in [27,28], while other approaches have used a Taylor-series expansion to linearize the equations and create an iterative algorithm [29,30]. Several other TDOA methods are based on least squares minimization of the location error [31][32][33][34][35]. For TOA, a popular method for computing the MS location is through the method of least squares [7,15,29].…”
Section: Algorithms For Locationmentioning
confidence: 99%
“…Location estimates have been formed by the exact solutions to the hyperbolic TDOA equations in [27,28], while other approaches have used a Taylor-series expansion to linearize the equations and create an iterative algorithm [29,30]. Several other TDOA methods are based on least squares minimization of the location error [31][32][33][34][35]. For TOA, a popular method for computing the MS location is through the method of least squares [7,15,29].…”
Section: Algorithms For Locationmentioning
confidence: 99%
“…To avoid iterative algorithms, two-stage, closed-form LS estimators have been extensively developed for ML approximation (Friedlander, 1987;Schau and Robinson, 1987;Smith and Abel, 1987a;Smith and Abel, 1987b;Chan and Ho, 1994;Brandstein and Silverman, 1997;Huang et al, 2001;and Cheung et al, 2004). These LS solutions can provide good initialization for iterative estimators, which converge with less computational effort to a source position estimate with higher accuracy Abel, 1987a andChan et al, 2006a).…”
Section: A Toa and Tdoa-based Algorithms With Losmentioning
confidence: 99%
“…These LS solutions can provide good initialization for iterative estimators, which converge with less computational effort to a source position estimate with higher accuracy Abel, 1987a andChan et al, 2006a). Some researchers have compared the performance of algorithms (Yu and Oppermann, 2004;Shen et al, 2008;Gezici et al, 2008;and So, 2011).…”
Section: A Toa and Tdoa-based Algorithms With Losmentioning
confidence: 99%
“…In this classification, a localization algorithm is an entity that reconstructs the target position, given a set of TDOA measurements. The interested reader may see [7,10,11] and the references therein for some guidelines in MLAT systems, and [12] for an equivalent comparison for Global Positioning System (GPS) geolocation algorithms. However, really (as we describe later), a localization algorithm is composed of a data model, which mathematically relates the unknown and known parameters, by a system of equations, and a numerical method to solve that system of equations.…”
Section: Introductionmentioning
confidence: 99%