Dictionary:Fast Fourier transform (FFT)

ADVERTISEMENT
From SEG Wiki
Revision as of 08:54, 23 February 2017 by Sborthelle (talk | contribs) (Marked this version for translation)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Other languages:
English • ‎español



An algorithm (such as the Cooley-Tukey method) that accomplishes the discrete Fourier transform more rapidly than direct evaluation. Most FFTs involve iterative methods and take advantage of mathematical symmetry and redundancy. See Sheriff and Geldart (1995, 549–550).