I´m trying to low-pass filter a 1-Dimensional random signal using the 1D Fast Fourier Transform (FFT) component in Millipede. However, despite the FFT component seems to work, the Inverse FFT can´t reconstruct the original signal as expected. Please, note that the “Original Signal” and the “Inverse FT” graphs are not very similar either in the figure or in this simple test file: FFTfilter.gh (32.5 KB).
Hi…two m-functions, sfft and sifft, are supplied as plain text counterparts to the Matlab binary built-in functions of fft and ifft. You can not only read their codes but also can step through their executions. The accompanied document derives and explains the Cooley-Tukey fast Fourier transform (FFT) algorithm.