The Radix-2 decimation-in-time Fast Fourier Transform (FFT) is the simplest and most common form of the Cooley-Turkey algorithm. The FFT is one of the most widely used digital signal processing algorithms. It is used to compute the Discrete Fourier Transform (DFT) and its inverse. It is widely used in noise reduction, global motion estimation and orthogonal-frequency-division-multiplexing systems such as wireless LAN, digital video broadcasting, digital audio broadcasting. It is described as the most important numerical algorithm of their lifetime.