Dictionary:Fast Fourier transform (FFT)

From SEG Wiki
Jump to navigation Jump to search

{{#category_index:F|fast Fourier transform (FFT)}} 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).