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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast matched field processing


    Weitere Titelangaben:

    Rasche angepaßte Feldverarbeitung für die Quellenlokalisierung


    Beteiligte:
    Aravindan, S. (Autor:in) / Ramachandran, N. (Autor:in) / Naidu, P.S. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1993


    Format / Umfang :

    5 Seiten, 13 Quellen




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Matched field processing for environmental inverse problems

    Tolstoy, A. | British Library Conference Proceedings | 1993


    On array design for matched-field processing

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


    Matched field processing of deep-water ambient noise

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


    Large aperture matched field processing via subaperture beamforming techniques

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


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

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