1) all phase Fast Fourier Transform
全相位快速傅里叶变换
2) phase derivative FFT
相位微商快速傅里叶变换
3) fast fourier transform (FFT)
快速傅里叶变换
1.
Then the fast Fourier transform (FFT) is adopted to calculate the Fourier coefficients of the fundamental.
介绍了电容型设备介质损耗因数在线监测的原理以及监测系统的组成,分析了测量结果的误差来源以及提高测量精度的方法,以谐波分析法为基础,采用基于DSP的跟踪频率变化交流同步采样技术,确保每个周期采样128个点,用快速傅里叶变换(FFT)求出电压、电流信号基波傅里叶系数,通过RS-485总线传给上层变电站信息管理系统。
2.
The Fast Fourier Transform (FFT), developed originally by Cooley and Tukey , is one of the Discrete Fourier Transform (DFT) algorithms .
由Cooley和Tukey提出的快速傅里叶变换算法(Fast Fourier Transform,FFT)是针对数据长度N等于2的整数次幂的算法,也即基2的FFT算法。
4) FFT
快速傅里叶变换
1.
A CGFFT algorithm for transformation from the near-field to the aperture-field;
近场口径场变换的共轭递度快速傅里叶变换算法
2.
The N = 2￣M FFT Algorithm for Decimation in Time;
时域抽取基2快速傅里叶变换（FFT）算法
3.
PRECISE LASER WAVELENGTH DETERMINED BY FFT;
用快速傅里叶变换精确测定激光波长
5) fast Fourier transform
快速傅里叶变换
1.
The Fast Fourier Transform Identifies the Frequency Responses of Mathematical Models in Discrete Time Domain;
快速傅里叶变换辨识时域离散数学模型的频率特性
2.
The numerical simulation of diffraction based on fast Fourier transform;
基于快速傅里叶变换的衍射现象的数值仿真
3.
The Realization of Fast Fourier Transform Based on FPGA in Laser Spectrum Detection;
激光光谱探测中快速傅里叶变换的FPGA实现
6) fast Fourier transforms
快速傅里叶变换
1.
The near field coupling can be computed by the traditional method of moments(MoM);while the impedance elements of far field coupling are characterized as a Toeplitz matrix by interpolating Green\'s function on a regular Cartesian grid,and the matrix-vector products are accelerated by fast Fourier transforms.
针对电大散射问题,提出了一种基于快速傅里叶变换的新算法。
补充资料：全相
1.旧时通俗话本﹑演义等绘有人物绣像及每回故事内容者，称"全相"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条