Archive for 11 Oct 2010

Fast Fourier Transform (FFT) (Part 3)

Part 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 FFT stands for fast Fourier Transform. The DFT (Discret Fourier Transform) applies to vectors containing any number of signal samples. But it is sssssssssllllllllllllllllllllllloooooooooooooowwwwwwww due to the repeated number of operation. Computing a DFT of n points takes n^2 arithmetical operations, while an FFT can compute the same result in only n log2(n) operations. […]