rapidly with the Fast Fourier Transform (FFT) algorithm. Fast Fourier Transform. FFTs are most efficient if the number of samples, N, is a power of 2.
確定! 回上一頁