数字信号处理A-Mitra课件 Ch112.pdfVIP

Discrete Fourier Transform Goertzel’s Algorithm Computation Computation ? A recursive DFT computation scheme that ? The N-point DFT X[k] of a length-N makes use of the identity sequence x[n], 0 ≤ n ≤ N ? 1 , is defined by ?kN WN =1 N ?1 kn X[k] = ∑n=0 x[n]WN , 0 ≤ k ≤ N ?1 ?kn