One-Dimensional Search Location Algorithm Based on TDOA


Yuyao He, Yanli Chu, Sanxue Guo, Journal of Information Processing Systems Vol. 16, No. 3, pp. 639-647, Jun. 2020  

10.3745/JIPS.04.0172
Keywords: Fang Algorithm, One-Dimensional Search, Search Variables, Time Difference of Arrival
Fulltext:

Abstract

In the vibration target localization algorithms based on time difference of arrival (TDOA), Fang algorithm is often used in practice because of its simple calculation. However, when the delay estimation error is large, the localization equation of Fang algorithm has no solution. In order to solve this problem, one dimensional search location algorithm based on TDOA is proposed in this paper. The concept of search is introduced in the algorithm. The distance d1 between any single sensor and the vibration target is considered as a search variable. The vibration target location is searched by changing the value of d1 in the two-dimensional plane. The experiment results show that the proposed algorithm is superior to traditional methods in localization accuracy.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
He, Y., Chu, Y., & Guo, S. (2020). One-Dimensional Search Location Algorithm Based on TDOA. Journal of Information Processing Systems, 16(3), 639-647. DOI: 10.3745/JIPS.04.0172.

[IEEE Style]
Y. He, Y. Chu, S. Guo, "One-Dimensional Search Location Algorithm Based on TDOA," Journal of Information Processing Systems, vol. 16, no. 3, pp. 639-647, 2020. DOI: 10.3745/JIPS.04.0172.

[ACM Style]
Yuyao He, Yanli Chu, and Sanxue Guo. 2020. One-Dimensional Search Location Algorithm Based on TDOA. Journal of Information Processing Systems, 16, 3, (2020), 639-647. DOI: 10.3745/JIPS.04.0172.