快速傅立葉轉換(FFT) Fast Fourier Transform • The Fast Fourier Transform (FFT) is a very efficient algorithm for performing a discrete Fourier transform • FFT algorithm published by Cooley & Tukey in 1965 • 怎麼做!! • 一般計算要求,採樣點是 2的次方. 8, 16, 32, …
Data flow diagram for N=8: a decimation-in-time radix-2 FFT breaks a length-N DFT into two length-N/2 DFTs followed by a combining stage consisting of many size-2 DFTs called "butterfly" operations (so-called because of the shape of the data-flow diagrams).
還有 • 卷積 Convolution
Fourier Transform and Convolution Let Then Convolution 時間域 Multiplication 頻率域
頻率域(f) 時間域(t) Find g(t) by Fourier transform !! IFT FT FT
Famous Fourier Transforms 傅立葉變換對 Sine wave Delta function
Famous Fourier Transforms Gaussian
Famous Fourier Transforms Sinc function Square wave