A Localization Method Using Frequency Difference of Arrival with Multiple Moving Observers

To address the localization challenges posed by the highly nonlinear nature of frequency difference of arrival (FDOA) equations in passive narrowband signal localization, this paper proposes a multiple-hypothesis Gauss-Newton (MNGN) iterative localization method. Initially, the method calculates multiple potential initial source positions using a single FDOA measurement. Subsequently, the Gauss-Newton (GN) algorithm is employed to iteratively refine these initial estimates while evaluating the cost function at each iteration. Finally, the solution with the lowest cost function value is selected as the final localization result. The proposed approach demonstrates superior localization performance compared to particle swarm optimization (PSO) and simulated annealing (SA) methods. It achieves Cramér-Rao lower bound (CRLB) accuracy under moderate Gaussian noise conditions while significantly reducing computational complexity.

Authors

Institutions

Publication Details

Published
2025-07-12
DOI
https://doi.org/10.1109/icsip65915.2025.11171546
Primary Topic
Indoor and Outdoor Localization Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Localization Method Using Frequency Difference of Arrival with Multiple Moving Observers

Fucheng Guo, Xi Li, Wenjun Zhang
Indoor and Outdoor Localization Technologies
article

A Localization Method Using Frequency Difference of Arrival with Multiple Moving Observers

Fucheng Guo, Xi Li, Wenjun Zhang
article en

Abstract

To address the localization challenges posed by the highly nonlinear nature of frequency difference of arrival (FDOA) equations in passive narrowband signal localization, this paper proposes a multiple-hypothesis Gauss-Newton (MNGN) iterative localization method. Initially, the method calculates multiple potential initial source positions using a single FDOA measurement. Subsequently, the Gauss-Newton (GN) algorithm is employed to iteratively refine these initial estimates while evaluating the cost function at each iteration. Finally, the solution with the lowest cost function value is selected as the final localization result. The proposed approach demonstrates superior localization performance compared to particle swarm optimization (PSO) and simulated annealing (SA) methods. It achieves Cramér-Rao lower bound (CRLB) accuracy under moderate Gaussian noise conditions while significantly reducing computational complexity.

National University of Defense Technology (CN)
Openalex Percentile: Top 72%
Indoor and Outdoor Localization Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.