COMPUTATIONALLY EFFICIENT, ROBUST ALGORITHM FOR MATCHED-FIELD PROCESSING

Citation
Aj. Degroot et Db. Harris, COMPUTATIONALLY EFFICIENT, ROBUST ALGORITHM FOR MATCHED-FIELD PROCESSING, Circuits, systems, and signal processing, 17(2), 1998, pp. 165-193
Citations number
14
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
0278081X
Volume
17
Issue
2
Year of publication
1998
Pages
165 - 193
Database
ISI
SICI code
0278-081X(1998)17:2<165:CERAFM>2.0.ZU;2-S
Abstract
The matched field processing (MFP) localization performance of very lo w frequency (VLF) arrays operated in the deep ocean basins appears to be limited more by uncertainty in the sound velocity profile (SVP) tha n by low signal-to-noise ratio (SNR). We present a new robust variatio n of MFP designed to be less sensitive to velocity error in weakly inh omogeneous environments. We analyze the computational requirements of this and other MFP algorithms. When either the search volume is large of the acoustic array is large, computational efficiency is an issue. We present an efficient MFP implementation for the conventional MFP al gorithm and our robust algorithm, We show that parallel implementation of these algorithms may allow real-time performance.