1887
  1. Home
  2. A-Z Publications
  3. Geophysical Prospecting
  4. Volume 17, Issue 3
  5. Article
Volume 17 Number 3
  • E-ISSN: 1365-2478

Abstract

A

An efficient method of computing spectrum and cross‐spectrum of large scale aero‐magnetic field (or of any other two‐dimensional field) has been developed and programmed for a digital computer. The method uses fast Fourier transform techniques. Briefly, the method is as follows: a digitized aeromagnetic map is divided into a number of rectangular blocks. Fourier transforms of these blocks are computed using a two‐dimensional fast Fourier transform method. Finally, the amplitude of the Fourier transforms is averaged to give the desired spectrum. Computation of cross‐spectrum follows the same lines. In fact, the same programme may be used to a compute the spectrum as well as cross‐spectrum. The method has a number of computational advantages, in particular it reduces greatly computational time and storage requirements. The programme has been tested on synthetic data as well as on real aeromagnetic data. It took less than 30 seconds on an IBM 360/50 computer to compute the spectrum of an aeromagnetic map covering an area of approximately 4500 square miles.

Loading

Article metrics loading...

/content/journals/10.1111/j.1365-2478.1969.tb02089.x
2006-04-27
2024-04-18

  • From This Site

    /content/journals/10.1111/j.1365-2478.1969.tb02089.x
    dcterms_title,dcterms_subject,pub_keyword
    -contentType:Journal -contentType:Contributor -contentType:Concept -contentType:Institution
    10
    5
Loading full text...

Full text loading...

References

  1. Bingham, C, M. D.Godfrey, J. W.Tukey (1967): Modern techniques of power spectrum estimation. IEEE Transactions on Audio and Electroacoustics., Vol. AU‐15, pp. 56–66.
    [Google Scholar]
  2. Cochran, W. J., J. W.Cooley, D. L.Favin, H. D.Helms, R. A.Kaenel, W. W.Lang, G. C.Maling, D. E.Nelson, C. M.Rader, P. D.Welch (1967): What is the fast Fourier transform. IEEE Transactions on Audio and Electroacoustics, Vol. AU‐15, pp. 45–55.
    [Google Scholar]
  3. Cooley, J. W., P. A. W.Lewis, P. D.Welch (1967): Application of the fast Fourier Transform to Computation of Fourier integrals, Fourier series and convolution integrals, IEEE Transactions on Audio and Electroacoustics, Vol. AU‐15, pp. 79–84.
    [Google Scholar]
  4. Cooley, J. W., J. W.Tukey (1965): An algorithm for the machine calculation of complex Fourier series. Math. Comput., Vol. 19, pp. 297–301.
    [Google Scholar]
  5. McCowan, D. W. (1966): Finite Fourier Transform Theory and its application to the computation of convolutions, correlations, and spectra. Tech. Memo.8–66, Earth Sciences Division, Teledyne Industries, Inc., Alexandria , Virginia , U.S.A. .
    [Google Scholar]
  6. Pugachev, V. S. (1965): Theory of random functions and its application to control problems. Pergamon Press, London (Eng. translation).
     [Google Scholar]
  7. Wiener, N. (1964): Extrapolation, interpolation, and smoothing of stationary time series, The M.I.T. Press, Cambridge , Mass .
    [Google Scholar]
http://instance.metastore.ingenta.com/content/journals/10.1111/j.1365-2478.1969.tb02089.x
Loading
  • Article Type: Research Article

Most Cited This Month Most Cited RSS feed

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error