A Fast ML-Based Single-Step Localization Method Using EM Algorithm Based on Time Delay and Doppler Shift for a Far-Field Scenario

doi:10.3390/s18124139

2018-11-26

DOI：10.3390/s18124139

原文链接

查看原文

摘要

En 中文

This study discusses the localization problem based on time delay and Doppler shift for a far-field scenario. The conventional location methods employ two steps that first extract intermediate parameters from the received signals and then determine the source position from the measured parameters. As opposed to the traditional two-step methods, the direct position determination (DPD) methods accomplish the localization in a single step without computing intermediate parameters. However, the DPD cost function often remains non-convex, thereby it will cost a high amount of computational resources to find the estimated position through traversal search. Weiss proposed a DPD estimator to mitigate the computational complexity via eigenvalue decomposition. Unfortunately, when the computational resources are rather limited, Weiss's method fails to satisfy the timeliness. To solve this problem, this paper develops a DPD estimator using expectation maximization (EM) algorithm based on time delay and Doppler shift. The proposed method starts from choosing the transmitter-receiver range vector as the hidden variable. Then, the cost function is separated and simplified via the hidden variable, accomplishing the transformation from the high dimensional nonlinear search problem into a few one dimensional search subproblems. Finally, the expressions of EM repetition are obtained through Laplace approximation. In addition, we derive the Cramer-Rao bound to evaluate the best localization performance in this paper. Simulation results confirm that, on the basis of guaranteeing high accuracy, the proposed algorithm makes a good compromise in localization performance and computational complexity.

Keyword:

direct position determination (DPD)

maximum likelihood (ML)

expectation maximization (EM)

Doppler shift

Laplace approximation

Cramer-Rao bound (CRB)