sinc傅立葉轉換的相關文章
sinc傅立葉轉換的相關商品

Fast Fourier Transform -- from Wolfram MathWorld
瀏覽:585
日期:2025-09-16
The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the base-2 logarithm. If the function to be transformed is not harmonically related to ...看更多