数字信号处理（邵曦）lecture19教学材料.pptVIP

9.8 FFT FFT: fast implementation of the DFT Common principle of the FFT algorithm: Convert the DFT of a long sequence into the merging of the DFTs of shorter sequences. ;N-DFT;(抽取);;For each k, a butterfly is needed: number of multiplication: 1; number of addition: 2 ;The typical FFT algorithm consists of three parts: (p.518) 1. Shuffling（重排）the N-dimensional input into N one- dimensional signals. 2. Performing N one-point DFTs. 3. Merging the N one-point DFTs into one N-point DFT. ;N=8： ;Other consideration in the FFT routine: Realize the shuffling through bit