Abstract
The problem of geolocating an unknown high-frequency emitter based on the quasi-parabolic ionosphere model with time-difference of arrival measurements of the refracted radio rays is of fundamental importance in various military and civilian applications. Such a problem admits a maximum-likelihood (ML) formulation, which is nonlinear and non-convex. By elucidating the geometry of the feasible set of the ML formulation, we develop a first-order algorithm, which we call Generalized Projected Gradient Descent, to solve it. We prove that every limit point of the iterates generated by our proposed algorithm is a critical point of the ML formulation. Simulation results show that our proposed algorithm can more reliably and accurately geolocate the emitter than a state-of-the-art method in various settings.
| Original language | English |
|---|---|
| Article number | 9145777 |
| Pages (from-to) | 1335-1339 |
| Number of pages | 5 |
| Journal | IEEE Signal Processing Letters |
| Volume | 27 |
| DOIs | |
| Publication status | Published - 2020 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'A Provably Convergent Projected Gradient-Type Algorithm for TDOA-Based Geolocation under the Quasi-Parabolic Ionosphere Model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver