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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast matched field processing


    Additional title:

    Rasche angepaßte Feldverarbeitung für die Quellenlokalisierung


    Contributors:

    Published in:

    Publication date :

    1993


    Size :

    5 Seiten, 13 Quellen




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    On array design for matched-field processing

    Tantum, S.L. / Nolte, L.W. | Tema Archive | 2000


    Matched field processing of deep-water ambient noise

    Sotirin, B.J. / Tran, J.M.Q.D. / Hodgkiss, W.S. jun. | Tema Archive | 1990


    Large aperture matched field processing via subaperture beamforming techniques

    Cox, H. / Zeskind, R.M. / Myers, M. | Tema Archive | 1989


    Data-driven matched field processing for Lamb wave structural health monitoring

    Harley, Joel B. / Moura, Jose M.F. | Tema Archive | 2014


    Source localization with broad-band matched-field processing in shallow water

    Booth, N.O. / Baxley, P.A. / Rice, J.A. et al. | Tema Archive | 1996