Generic uniform search grid generation algorithm for far-field source localization

  • Lee J
  • Chung S
  • Kang H
  • et al.
0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this letter, a generic search grid generation algorithm for far-field source localization (SL) is proposed. Since conventional uniform regular grid structures only consider the resolution of the distribution, it is difficult to control the number of grid points to be distributed. The proposed algorithm generates a search grid by distributing a desired number of points evenly, depending on the target criterion, in either direction of arrival or time difference of arrival domain. The experimental results show that the proposed algorithm provides optimally distributed grid points given the number of desired points and the corresponding domain for SL processing.

Cite

CITATION STYLE

APA

Lee, J., Chung, S.-W., Kang, H.-G., & Choi, M.-S. (2018). Generic uniform search grid generation algorithm for far-field source localization. The Journal of the Acoustical Society of America, 143(1), EL37–EL42. https://doi.org/10.1121/1.5021708

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free