Definitions for "Fast Fourier Transform"
A computer algorithm which derives the fourier spectrum from a sound file.
(n.) See FFT
An acronym for Fast Fourier Transform, a technique for very fast computation of Fourier series. A discrete Fourier transform using N points can be computed in N log N steps by the fast method, whereas the straightforward method would take N^2 steps. Xilinx has a number of FFT implementations available for customers targeting different devices, performance requirements and point sizes.
A method by which to decompose data into a sum of sinusoids of varying cycle length, with each cycle being a fraction of a common fundamental cycle length.
Decomposes a periodic series of data into its component frequencies.