Share Email Print

Proceedings Paper

Two solutions to the localization using time difference of arrival problem
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, two new solutions to the localization of an emitter using time difference of arrival (TDOA) measurements are proposed. The maximum likelihood estimation for this problem will result in a nonlinear and nonconvex optimization problem, which is very difficult to solve. The solutions presented in this paper consider an alternate formulation, which is based on the sensor-emitter geometry. This formulation results in quadratic (however, nonconvex) optimization problem. The first solution relaxes the original optimization problem into a semidefinite program (SDP). Using the solution to this relaxed SDP, emitter is localized using a randomization technique. The second solution forms the Lagrangian dual of the original problem, and it is shown that the dual problem is an SDP. From the solution to the dual problem a solution to the original problem is found. It has to be noted that the solution obtained using the optimal dual variable, is optimal to the original problem only if strong duality holds. This has not been proven in this paper analytically. Extensive simulations performed suggests that the strong duality may hold for this problem.

Paper Details

Date Published: 7 May 2007
PDF: 9 pages
Proc. SPIE 6567, Signal Processing, Sensor Fusion, and Target Recognition XVI, 656704 (7 May 2007); doi: 10.1117/12.719068
Show Author Affiliations
T. Sathyan, McMaster Univ. (Canada)
T. Kirubarajan, McMaster Univ. (Canada)

Published in SPIE Proceedings Vol. 6567:
Signal Processing, Sensor Fusion, and Target Recognition XVI
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top