Fast fourier transform

From Glossary of Meteorology



fast Fourier transform

(Abbreviated FFT.) An algorithm to compute rapidly the digital form of the discrete Fourier transform.

The procedure requires that the length of the data series undergoing transformation be an integral power of two, which is often achieved by truncating the series or extending it with zeros. More flexible mixed-radix algorithms have been developed that allow data series of any length. They gain efficiency as the prime factors of the length become small, and they are equivalent to the FFT when the data series length is a power of two.


Copyright 2024 American Meteorological Society (AMS). For permission to reuse any portion of this work, please contact permissions@ametsoc.org. Any use of material in this work that is determined to be “fair use” under Section 107 of the U.S. Copyright Act (17 U.S. Code § 107) or that satisfies the conditions specified in Section 108 of the U.S.Copyright Act (17 USC § 108) does not require AMS’s permission. Republication, systematic reproduction, posting in electronic form, such as on a website or in a searchable database, or other uses of this material, except as exempted by the above statement, require written permission or a license from AMS. Additional details are provided in the AMS Copyright Policy statement.