A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT rapidly computes such transformations byfactorizing the DFT matrix into a product of sparse factors. 16point FFT code~ This code is very useful to you studying about FFT algorithm for verilog. i hope this will be helpful for you.