Scribd
Upload
85 views3 pages

Applying Fast-Fourier Transform in MAGMAP

Uploaded by

Pratama Abimanyu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
85 views3 pages

Applying Fast-Fourier Transform in MAGMAP

Uploaded by

Pratama Abimanyu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

montaj MAGMAP Filtering How-To Guide

Applying Fast-Fourier Transform in MAGMAP


This Applying Fast-Fourier Transform in MAGMAP How-To Guide describes the Fast-Fourier Transform process and
demonstrates how to apply this process to your gridded data.
MAGMAP applies filters in the Fourier domain. The MAGMAP FFT filters are typically applied to geophysical potential field
data. The filters have a wide range of application: they can remove geologic and cultural noise, perform regional/residual
separations, estimate physical properties, such as magnetic susceptibility and rock density and modify the datum at which
the data was originally collected, such as up/downward continuation and reduction to the magnetic pole. In addition, an
interactive tool provides you with the ability to view the symmetrical filter traces on the same graph as the radially averaged
power spectrum and thus tune the filter parameters for the best expected results.
MAGMAP enables you to filter the data in using the following methods:
1. 1-Step FFT process
2. Step-by-Step approach
3. Interactive FFT process
The Step-by-Step approach enables you to control each part of the sequence (prepare grids, apply forward FFT, set filters,
and apply inverse FFT), whereas the 1-Step process performs the grid preparation, forward FFT, filtering and inverse FFT
steps in one go. The interactive process enables you to visualize the data power spectrum waveform as well as the filter
operator. You can interactively refine the filter parameters to yield optimal results.

Applying the Forward Fast-Fourier Transform


After the grid preparation, you apply the forward Fast-Fourier Transformation (FFT).

To apply the forward Fast-Fourier Transform:


1. From the MAGMAP menu, select Step-by-Step Filtering and then select Forward FFT.
The FFT2IN dialog appears.

2. MAGMAP defaults are intelligently set; the output of the previous step becomes the default of the current step. The
Name of Input Pre-processed Grid File is already defaulted to the grid outputted from the earlier prepare grid step.
3. Click the OK button.
The system computes the transform and saves it as the name you supplied appended with ”_trn" in the current
directory. You will next apply the Filters to this transform.

www.geosoft.com 1
montaj MAGMAP Filtering How-To Guide

The transform signal has real and imaginary components; these are saved as interleaved in the output grid. As a
result, although the grid format is used for storage, the transform has no meaningful expression visually. The
stipulation that the output should require twice the storage space of the input grid is balanced with the fact that the
transform of a periodic signal is symmetrical along the Y axis and thus the 3rd & 4th quadrant information becomes
redundant.
The net outcome is that the transform has the same Y dimension as the input grid, but in X, it has to take into
account the real and imaginary components of the folding axis and thus its X dimensions will be set to the input X
dimension +2.

Interactive Filtering Method


The interactive process enables you to visualize the data power spectrum waveform as well as the filter operator. You can
interactively refine the filter parameters to yield optimal results.

To apply the forward Fast-Fourier Transformation:


1. From the MAGMAP menu, select Interactive Filtering and then select Forward FFT.
The FFT2IN dialog appears.

2. Using the button, specify the Name of Input Pre-processed Grid File. This should be the default value.
3. Click the OK button.
The system computes the transform. It also creates a new Input Transform File, the name you supplied appended
with "_trn” to which you will calculate the Radially Averaged Spectrum and later apply the Filters and Inverse
Transform.

The FFT Algorithm


In MAGMAP, Fast Fourier Transform (FFT) is used to convert the space domain grid data to the Fourier domain. The
system applies Fast Fourier Transform (FFT) to a space domain grid to produce a folded 2D transform as output. As part of
the process, MAGMAP also calculates and saves a radially averaged energy spectrum of the transform.
The system creates a Fourier domain grid, which is called a Transform. It has the same name as the input grid, but with the
.TRN extension. The transform grid contains a folded discrete Fourier transform of the input grid.
The size of the transform grid element is 4 bytes; each pair of elements represents the real and imaginary component of a
complex number. The transform is stored in the same way as the input grid, so that each transform vector (row) represents
a vector in the storage direction of the input grid (X for kx=1, Y for kx=-1). The following table illustrates the logical storage
of the transform:

2 www.geosoft.com
montaj MAGMAP Filtering How-To Guide

Vectors Elements

E(1,2) E(3,4) E(5,6) E(n+1) E(n+2)

1 / 2e (nyq.) V(n) -(1/nv) r ir ir i* r i

V(n-1) -(2/nv) r ir ir i* r i

* * * *

V(n/2+2) -(1/2v - 1/nv) r ir ir i* r i

V(n/2+1) 1/2v (nyq.) r ir ir i* r i

V(n/2) -1/nv r ir ir i* r i

* * * *

2 / ne V(3) 2/nv r ir ir i* r i

1 / ne V(2) 1/nv r ir ir i* r i

0 V(1) 0 r ir ir i* r i

where:
r, i are real and imaginary components of each transform element
e, v are element and vector separations (cell size)
n is the original grid dimension in cells
The transform element separation (1/ne) and vector separation (1/nv) is 1 / (grid dimension) cycles/metre. Since both the
grid and the grid cell are square, 1/ne = 1/nv. The Nyquist wavenumber is the largest wavenumber that has been sampled
by the grid, and is defined as one over twice the grid cell size (1/2e and 1/2v, which are also equal).
Looking at the above table, you can note that each transform vector (row) represents a discrete Fourier row in the direction
of the input grid vectors. The Fourier elements within each row start at 0 cycles/metre and extend to the Nyquist
wavenumber in 1/ne increments.
As a result, the transform grid has (n/2 + 1) elements per vector, where n is the number of elements per vector in the original
grid. The transform is folded at the Nyquist wavenumber in the direction of the grid vectors, so the transform grid has n
vectors.

How-To Guide Publication Date: 16/01/2013


Copyright 2013 Geosoft Inc. All rights reserved.

www.geosoft.com 3

You might also like