南京理工大学数字信号处理英文课件 Lecture21.pptVIP

288 * Computing the Discrete Fourier Transform ? Principle and complexity issues ? Decimation in time algorithms Lecture 21 Discrete Fourier Transform ( IV ) ? (N－1) complex additions and N complex multiplications per sample of DFT ? Roughly N 2 complex additions and multiplications to compute whole DFT ? Can be reduced to N log 2 N by using symmetry and periodicity of W N k n ? Fast Fourier Transform (FFT) A. Principle Principle ( II ) ? complex operations: N multiplication addition 16