Fast Matched Field Processing

Aravindan, S and Ramachandran, N and Naidu, Prabhakar S (1993) Fast Matched Field Processing. In: IEEE Journal of Oceanic Engineering, 18 (1). 1 -5.

Preview

PDF Fast_Matched.pdf Download (510kB)

Abstract

Source localization by matched field processing (MFP) requires computation of theoretical field over a dense grid of source range and depth in the region where the source is likely to be present. The computed field at each grid point is then correlated with the observed field. In this paper we show how the computational burden can significantly be reduced (20 to 30 times) by expressing the correlation in terms of discrete Fourier transform and using the fast Fourier transform (FFT) algorithm. A price that one pays 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 above algorithm for different depths.

Item Type:	Journal Article
Publication:	IEEE Journal of Oceanic Engineering
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	22 Aug 2008
Last Modified:	19 Sep 2010 04:26
URI:	http://eprints.iisc.ac.in/id/eprint/6785

Actions (login required)

View Item