一种是快速傅立叶变换(FFT)加速算法。
One is the fast Fourier transform (FFT) accelerated algorithm.
应用快速傅立叶变换方法对脉搏信号进行了分析。
The pulse signals were processed by using the fast Fourier transforms.
快速傅立叶变换。
快速傅立叶变换是一种有效、实用的信号DFT算法。
Fast Fourier transformation is an effective, practical DFT algorithm.
实践应用表明，在在线监测系统中应采用快速傅立叶变换算法。
Application result shows that fast Fourier transforms should be adopted in on-line monitoring...
然后对时窗内的波形作快速傅立叶变换，在频域内求地层波能量。
Then the waveforms in the window are performed with FFT and the formation wave energy is calculated in frequency domain.
用快速傅立叶变换相位探测技术(FFT)分析自混合干涉信号。
FFT phase detection technique was applied to analyze SMI signal.
主要工作有：基于快速傅立叶变换与声学模型的音频数字水印算法研究。
Main ideas as follows: Research of audio digital watermark Algorithm based on Fast Fourier Transforms and psychoacoustic auditory model.
快速傅立叶变换用到的窗宽度长度有限，因此不能获得完美的频率分辨率。
In STFT is window is of finite length, and we no longer have perfect frequency resolution.
介绍了通过基于快速傅立叶变换（FFT）的谱分析确定综框的动态特性。
The method of impact excitation testing with Fast Fourier Transform (FFT) based on spectrum analyzer to determine the dynamic characteristics of a heald frame is introduced.
并利用快速傅立叶变换方法对谐波、闪变和纯正弦波等稳态现象进行分析。
As to steady state phenomena, the traditional signal analysis tool FFT is used for harmonic analysis and flicker.
用波数域的位场转换和快速傅立叶变换理论研究重力归一化总梯度和归一化相位；
The normalized full gradient and phase of gravity anomalies have been studied by potential field conversion and fast Fourier transform in wave-number domain.
在图像灰度分布互相关和快速傅立叶变换的基础上，研究了粒子图像测速的实现。
On the basis of image cross correlation of brightness distribution and Fast Fourier Translation, the implementation of Particle image Velocimetry was studied.
针对此问题，笔者提出了一种基于快速傅立叶变换和功率谱密度计算的解决方法。
Aiming at this problem, an effective method based on FFT and power spectral density computing has been put forward.
数字信号处理器(dsp)是鉴于数字滤波和快速傅立叶变换的数字信号处理技术。
Digital signal processor (DSP) is used to meet the need of digital signal processing technique, such as digital filer and FFT.
目前已有的电力谐波监测系统大多采用基于快速傅立叶变换（FFT）的检测方法。
Most of present harmonics-monitors adopt the technique of Fast Fourier Transform (FFT) to detect harmonics. However, FFT needs longer time to collect and process the signal.
OFDM中的关于快速傅立叶变换的个人设计的MATLAB的算法，比较经典的！
OFDM on the Fast Fourier Transform personal design MATLAB algorithm, more classic!
该方程对任意分布形式的输入光束具有普适性、并便于利用快速傅立叶变换算法实现。
This equation is adapted to any shape's input beam and can be easily realized using fft arithmetic.
APEX是一种基于快速傅立叶变换的直接盲解卷积算法，能够快速复原复杂纹理图像。
The APEX method is an FFT-based direct blind deconvolution technique that can recover complex texture imagery quickly.
快速傅立叶变换、滑动窗口和某些Linux音频编程可以为您提供符合您所选语言的音调识别能力。
Fast Fourier transforms, sliding percentage Windows, and some Linux audio programming can give you tonal-recognition capabilities with your language of choice.
而要通过快速傅立叶变换(FFT)获得准确的频域参数，又必须得到完整的时域波形数据。
Meanwhile, data of complete time domain waveform is needed in order to calculate accurate S-parameters of frequency domain via fast Fourier transform (FFT).
提出用快速傅立叶变换计算二维模糊控制器的描述函数，并用来判别模糊控制系统的稳定性。
In order to analyze the stability of fuzzy control systems, the description function of fuzzy controller is calculated by using the fast Fourier transformation.
另外，快速傅立叶变换仅适用于分析平稳渐变的信号，不能适应负荷动态变化的电力谐波检测。
In addition, FFT is applicable to analyze gradually-changed signals instead of detecting harmonics when the load breaks.
详细研究了基于快速傅立叶变换(FFT)的数字粒子图象测速技术(DPIV)的互相关算法。
A cross correlation algorithm based on Fast Fourier Transform (FFT) for Digital Particle Image Velocimetry (DPIV) is discussed thoroughly in this paper.
在软件设计中，以快速傅立叶变换算法(FFT)为基础，采用复合控制方法控制电容器的投切。
With the Fast Fourier Transform (FFT) algorithm in software design, capacitors being switched on or off are controlled by compound criterion.
对采样后的数据运用快速傅立叶变换(FFT)进行数值计算，获得了高精度的风井综合参数的测量。
Sampling data using fast Fourier transform (FFT) to numerical algorithm has obtained the high accuracy air shaft synthesis parameter survey.
在分析傅立叶变换特性的基础上，利用傅立叶变换核的三阶对称性，给出了一种快速傅立叶变换算法。
After analysing the character of Fourier transform, using 3 level symmetry of Fourier Kernel as a new algorithm for fast Fourier transform was proposed.
在粒子图像测速原理的基础上研究了基于快速傅立叶变换的粒子图像测速算法，并编制算法程序进行验证。
A study was performed on the PIV algorithm based on fast Fourier transformation (FFT), and the PIV program was compiled and verified.
通过对磁力仪进行大约40秒的响应度记录并做一个快速傅立叶变换(FFT)，获得了它的磁场灵敏度数据。
The magnetic field sensitivity data are obtained by recording the response of the magnetometer for about 40s, performing a fast Fourier transform (FFT).
但是，与快速傅立叶变换相比，倍频旋转变换理论所需要的计算时间很长，这在一定程度上影响了它的广泛应用。
But compare with FFT, the calculation time needed by the multiple frequency rotate transform is very long, which has influenced its wide application to a certain extent.
应用推荐