A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. A Fourier transform converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations. As a result, fast F

different matlab code for convolution, discrete fourier transform, finite impulse response, inverse DFT, descimator