Search - N-points FFT

Search - N-points FFT - List

[source in ebook] KFFT DL : 0: 计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。-A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.
Date : 2026-01-03 Size : 1kb User : 冯短
[source in ebook] rfft DL : 0: Real sequence of Fourier transform 实序列傅立叶变换已验证用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量 -Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational complexity
Date : 2026-01-03 Size : 1kb User : 孙金涛