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.
Fast matched field processing
Rasche angepaßte Feldverarbeitung für die Quellenlokalisierung
IEEE Journal of Oceanic Engineering ; 18 , 1 ; 1-5
1993
5 Seiten, 13 Quellen
Article (Journal)
English
Digitalsimulation , schnelle Fourier-Transformation , Maximum-Likelihood-Verfahren , diskrete Fourier-Transformation , Rechnersimulation , Algorithmus , Signalverarbeitung , Phasenfehler , Quantisierung , numerisches Verfahren , Schallquelle , akustisches Signal , Schätzung , akustische Signalverarbeitung , Schätztheorie
On array design for matched-field processing
Tema Archive | 2000
|Matched field processing of deep-water ambient noise
Tema Archive | 1990
|Large aperture matched field processing via subaperture beamforming techniques
Tema Archive | 1989
|Data-driven matched field processing for Lamb wave structural health monitoring
Tema Archive | 2014
|Source localization with broad-band matched-field processing in shallow water
Tema Archive | 1996
|