"FFT algorithms are so commonly employed to compute DFTs that the term ... Therefore, the Discrete Fourier Transform of the sequence x[n] can be defined as:.
確定! 回上一頁