Design and power measurement of different points FFT using Radix-2 algorithm for FPGA implementation

In Cooley-Tukey algorithm the Radix-2 decimation-in-time Fast Fourier Transform is the easiest form. The Fast Fourier Transform is the mostly used in digital signal processing algorithms. Discrete Fourier Transform (DFT) is computing by the FFT. DFT is used to convert a time domain signal into its frequency spectrum domain. FFT algorithm use many applications for example, OFDM, Noise reduction, Digital audio broadcasting, Digital video broadcasting. It's used to design butterflies for different point FFT. In this paper given to design and power measurement 16 and 32 point FFT by using VHDL. Simulation and synthesis of design is done using Xilinx ISE 14.2.