由Cooley和Tukey提出的快速傅里叶变换算法(Fast Fourier Transform,FFT)是针对数据长度N等于2的整数次幂的算法,也即基2的FFT算法。
基于2个网页-相关网页
的快速傅里叶变换算法 Fast Fourier Transform ; FFT
提出了一种应用快速傅里叶变换算法提高哈特曼夏克波前传感器波前重构实时性的快速算法。
Based on the fast Fourier transform (FFT) algorithm, the wave-front reconstruction algorithm of Shack-Hartmann sensor is described.
自提出快速傅里叶变换算法(FFT)以来，基于傅里叶变换的谐波测量便得到了广泛应用。
Since the Fast Fourier Transform (FFT) was presented, the harmonics measurement based on Fourier Transform which requires synchronous sampling has been used widely.
离散快速傅里叶变换算法在频谱分析中得到了广泛的应用，这种算法得到的计算结果是在整个频段上的频谱信息。
Discrete fast Fourier transform (FFT) has been widely applied to signal spectral analysis and can figure out the entire bandwidth spectrum of a signal.
应用推荐