Fast Fourier transform (FFT) is the main algorithm for harmonic analysis in electric power system, but when there is the decaying DC component in input signal, FFT algorithm will have higher error.
快速傅里叶变换(FFT)是电力系统进行谐波分析的主要算法，但当输入信号中含有衰减直流分量时，FFT算法会产生较大的误差。
The fast Fourier transform (FFT) will bring on higher error under nonsynchronous sampling and truncated non-integral period, thus more accurate interharmonic parameter values cannot be obtained.
快速傅里叶变换在非同步采样和非整数周期截断的情况下存在较大误差，无法获得较精确的间谐波参数值。
One is the fast Fourier transform (FFT) accelerated algorithm.
一种是快速傅立叶变换(FFT)加速算法。
Spatial and temporal frequency tuning characteristics of the pattern electroretinogram (PERG) were analysed by means of the fast Fourier transform (FFT)technique.
用快速傅里叶转换（FFT）技术分析了图形视网膜电图（PERG）的空间和时间调谐特性。
Meanwhile, data of complete time domain waveform is needed in order to calculate accurate S-parameters of frequency domain via fast Fourier transform (FFT).
而要通过快速傅立叶变换(FFT)获得准确的频域参数，又必须得到完整的时域波形数据。
Discrete fast Fourier transform (FFT) has been widely applied to signal spectral analysis and can figure out the entire bandwidth spectrum of a signal.
离散快速傅里叶变换算法在频谱分析中得到了广泛的应用，这种算法得到的计算结果是在整个频段上的频谱信息。
The conjugate gradient method (CGM) and fast Fourier transform (FFT) technique are used to reduce the necessary memory and CPU time.
在求解过程中应用共轭梯度法(CGM)和快速傅立叶变换(FFT)相结合的方法降低所需计算机内存和CPU时间。
Aiming at the acquisition problem of direct sequence spread-spectrum (DSSS) signals with large Doppler offset, a new method based on fast Fourier transform (FFT) is proposed.
针对具有大多普勒偏移的直接序列扩频信号捕获问题，提出一种基于快速傅里叶变换(FFT)的多普勒和伪码分别并行搜索的捕获新方法。
The standard method for spectrum analysis in digital signal processing is the discrete Fourier transform(DFT), typically implemented using a fast Fourier transform(FFT) algorithm.
数字信号处理中标准的频谱分析方法是离散傅立叶变换（DFT），典型的实现方法是快速傅立叶变换（FFT）。
The error of the decimate in time (DIT) radix-2 fast Fourier transform (FFT) is analyzed, where the data format is two's complement.
分析了按时间抽取（DIT）基-2快速傅里叶变换（FFT）的误差，数据格式为二进制补码。
Based on the fast Fourier transform (FFT) algorithm, the wave-front reconstruction algorithm of Shack-Hartmann sensor is described.
提出了一种应用快速傅里叶变换算法提高哈特曼夏克波前传感器波前重构实时性的快速算法。
Fast Fourier Transform (FFT) is an effective method to detect harmonic.
快速付立叶变换(FFT)是对谐波进行检测的有效方法。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
The magnetic field sensitivity data are obtained by recording the response of the magnetometer for about 40s, performing a fast Fourier transform (FFT).
通过对磁力仪进行大约40秒的响应度记录并做一个快速傅立叶变换(FFT)，获得了它的磁场灵敏度数据。
After comparing the FFT (fast Fourier transform) and WT (wavelet transform), this paper gives the selection firstly. WT is chosen to analyse the pressure response signal from the EHS.
本论文在试验阶段，首先对傅立叶变换和小波变换进行了对比，选择用小波变换来分析从电液伺服系统提取的压力信号。
In addition to the DFT, which is usually implemented as the FFT, or fast Fourier transform, you may also want to read about the STFT (short-time Fourier transform).
此外，DFT，这通常是由于FFT实现，或快速傅里叶变换，你可能还想阅读有关的STFT(短时傅里叶变换)。
After deeply studied in the fast Fourier transform (FFT) method, this paper presents an improved FFT algorithm considering the half-wave symmetric characteristic of power system signals.
在深入分析快速傅里叶变换(FFT)方法的基础上，针对一类电网信号具有半波对称性的特点，提出了一种改进的FFT算法。
Sampling data using fast Fourier transform (FFT) to numerical algorithm has obtained the high accuracy air shaft synthesis parameter survey.
对采样后的数据运用快速傅立叶变换(FFT)进行数值计算，获得了高精度的风井综合参数的测量。
The FFT (fast fourier transform) algorithm and the mass center notion were used to develop a fast estimation algorithm named the Mass Center Method (MCM).
基于快速傅里叶变换 （FFT）运算和质量中心的概念 ，提出一种快速的高性能估计算法 ，称为质量中心法。
This paper mainly describes the applicability of fast Fourier transform (FFT) deconvolution technique, which is used in assessing the residence time distribution (RTD) of reactors.
本文系统研究了快速傅里叶解卷积技术对于反应器停留时间分布求解问题的适用性。
The two-dimensional fast Fourier transform (2D-FFT) method has been used to analyze the ultrasonic signals where different wave modes overlaid in the time domain.
利用二维快速傅立叶变换的时频分析方法，对有限元计算得到的时域信号进行了分离，得到了各个模式超声波的相速度色散曲线。
Here, secondary treatment methods are introduced in detail, include time domain signal statistics character, frequency analysis fast Fourier transform (FFT), and short time Fourier transform (STFT).
这里，主要对二次处理的方法作了详细的介绍，包括时域信号的统计特征，频域分析的傅立叶变换和短时傅立叶变换。
Basic theory of spectrum analysis and Fast Fourier Transform (FFT) algorithm are briefly introduced.
简介了频谱分析的基础理论和快速傅利叶变换(FFT)算法。
Employing the Fast Fourier Transform Algorithm (FFT) to determine the initial tap coefficients of equalizers is fundamentally different from using the current iteration method.
用快速离散傅立叶变换(FFT)的方法确定均衡器的初始抽头系数，它区别于目前常用的迭代算法。
On the basis of the features of the Fast Fourier Transform (FFT) and digitally modulated signals, this paper proposes a blind channel estimation algorithm.
根据快速傅里叶变换(FFT)和数字信号调制解调的特点，给出了一种盲信道质量估计算法。
Since the Fast Fourier Transform (FFT) was presented, the harmonics measurement based on Fourier Transform which requires synchronous sampling has been used widely.
自提出快速傅里叶变换算法(FFT)以来，基于傅里叶变换的谐波测量便得到了广泛应用。
The Fast Fourier Transform (FFT) is one of the most important algorithm of real-time signal processing. It's widely used in EW receivers.
FFT是电子战接收机信号处理的关键算法之一，在数字EW 接收机中有着广泛的应用前景。
RS encoder in DVB-S and some classical decoding algorithms are introduced, then some Fast Fourier Transform (FFT) algorithms in finite domain are presented.
本文介绍了DVB - S中RS码的编码及常用的译码算法，然后又介绍了几种有限域中快速傅里叶变换(FFT)算法。
This paper introduces the Fast Fourier Transform(FFT) implementation in fixed-point DSP TMS320C5402.
论述了采用定点数字信号处理（DSP）芯片TMS320C5402实现快速傅里叶变换（FFT）。
This paper introduces the Fast Fourier Transform(FFT) implementation in fixed-point DSP TMS320C5402.
论述了采用定点数字信号处理（DSP）芯片TMS320C5402实现快速傅里叶变换（FFT）。
应用推荐