Next:
Discrete Fourier transform
Up:
Table of Contents
Discrete Fourier transform
FT AS AN INVERTIBLE MATRIX
The Nyquist frequency
Laying out a mesh
The comb function
Undersampled field data
INVERTIBLE SLOW FT PROGRAM
The slow FT code
Truncation problems
FT by Z-transform
SYMMETRIES
Plot interpretation
Convolution in the frequency domain
SETTING UP THE FAST FOURIER TRANSFORM
Shifted spectra
TWO-DIMENSIONAL FT
Basics of two-dimensional Fourier transform
Signs in Fourier transforms
Examples of 2-D FT
HOW FAST FOURIER TRANSFORM WORKS
References
About this document ...
Stanford Exploration Project
10/21/1998
![[*]](http://sepwww.stanford.edu/latex2html/prev_gr.gif)
