FFT

Fast Fourier Transform is an efficient algorithm for computing DFT (discrete Fourier transform) or an inverse DFT. More efficient than a Discrete Cosine Transfer (DCT), although DCT is also based on Fourier transforms. Described by Dr. Gilbert Strang, one of the foremost mathmeticians and a professor at MIT, as "the most important numerical algorithm of our lifetime" when referring to the most common FFT (known as the Cooley-Tukey algorithm). http://videolectures.net/mit18085f07_strang_lec23/