Fast Fourier Transform -- from Wolfram MathWorld

Fast Fourier Transform -- from Wolfram MathWorld

瀏覽:1039
日期:2024-07-11
The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the base-2 logarithm. If the function to be transformed is not harmonically related to ...看更多