Fast matched field processing

Author

Aravindan, S. ; Ramachandran, N. ; Naidu, Prabhakar S.

Author_Institution

Dept. of Electr. & Commun. Eng., Indian Inst. of Sci., Bangalore, India

Volume

18

Issue

1

fYear

1993

fDate

1/1/1993 12:00:00 AM

Firstpage

1

Lastpage

5

Abstract

It is shown how the computational burden of source localization by matched field processing (MFP) can be significantly reduced (20 to 30 times) by expressing the correlation in terms of a discrete Fourier transform and using the fast Fourier transform (FFT) algorithm. The price paid to achieve increased speed is in the form of quantization phase errors. It is shown through analysis and computer simulation that the quantization errors reduce the source peak height, depending upon the size of DFT. The proposed fast MFP works for range localization only. However, the depth estimation is possible by repeated application of the above algorithm for different depths

Keywords

acoustic signal processing; digital simulation; estimation theory; fast Fourier transforms; acoustic pressure estimation; computer simulation; depth estimation; discrete Fourier transform; matched field processing; maximum likelihood method; quantization errors; range localization; source localization; source peak height; Acoustic sensors; Computer errors; Computer simulation; Discrete Fourier transforms; Fast Fourier transforms; Grid computing; Numerical simulation; Position measurement; Quantization; Sensor arrays;

fLanguage

English

Journal_Title

Oceanic Engineering, IEEE Journal of

Publisher

ieee

ISSN

0364-9059

Type

jour

DOI

10.1109/48.211502

Filename

211502