A Maximum-Likelihood TDOA Localization Algorithm Using Difference-of-Convex Programming

A popular approach to estimate a source location using time difference of arrival (TDOA) measurements is to construct an objective function based on the maximum likelihood (ML) method. An iterative algorithm can be employed to minimize that objective function. The main challenge in this optimization...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE signal processing letters Jg. 28; S. 309 - 313
Hauptverfasser:	Ma, Xiuxiu, Ballal, Tarig, Chen, Hui, Aldayel, Omar, Al-Naffouri, Tareq Y.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms CCCP Computational geometry Convergence Convex analysis Convex functions convex-concave Convexity DC programming difference of convex Iterative algorithms Linear programming Localization Location awareness Lower bounds Mathematical programming Maximum likelihood estimation Maximum likelihood estimators non-convex Optimization Position measurement Programming TDOA
ISSN:	1070-9908, 1558-2361
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!