快速傅立叶变换是一种有效、实用的信号DFT算法。
Fast Fourier transformation is an effective, practical DFT algorithm.
一种是快速傅立叶变换(FFT)加速算法。
One is the fast Fourier transform (FFT) accelerated algorithm.
主要工作有：基于快速傅立叶变换与声学模型的音频数字水印算法研究。
Main ideas as follows: Research of audio digital watermark Algorithm based on Fast Fourier Transforms and psychoacoustic auditory model.
核心模块快速傅立叶逆变换（IFFT）采用基于16位定点运算的基-2时间抽取算法和流水线结构。
The radix-2 decimation-in-time algorithm based on 16-bit fixed-point operation and pipeline architecture are adopted in the core module IFFT(Inverse Fast Fourier Transform).
详细研究了基于快速傅立叶变换(FFT)的数字粒子图象测速技术(DPIV)的互相关算法。
A cross correlation algorithm based on Fast Fourier Transform (FFT) for Digital Particle Image Velocimetry (DPIV) is discussed thoroughly in this paper.
APEX是一种基于快速傅立叶变换的直接盲解卷积算法，能够快速复原复杂纹理图像。
The APEX method is an FFT-based direct blind deconvolution technique that can recover complex texture imagery quickly.
目前，应用最广泛的故障信号分析处理方法是傅立叶(Fourier)分析和相应的FFT快速算法。
At present, the most widely used fault signal analysis and processing method is Fourier analysis and Fourier corresponding FFT fast algorithm.
在软件设计中，以快速傅立叶变换算法(FFT)为基础，采用复合控制方法控制电容器的投切。
With the Fast Fourier Transform (FFT) algorithm in software design, capacitors being switched on or off are controlled by compound criterion.
戈泽尔算法是离散傅立叶变换的一种快速算法。
OFDM中的关于快速傅立叶变换的个人设计的MATLAB的算法，比较经典的！
OFDM on the Fast Fourier Transform personal design MATLAB algorithm, more classic!
用快速离散傅立叶变换(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.
在粒子图像测速原理的基础上研究了基于快速傅立叶变换的粒子图像测速算法，并编制算法程序进行验证。
A study was performed on the PIV algorithm based on fast Fourier transformation (FFT), and the PIV program was compiled and verified.
针对一类单幅图像的复制遮盖篡改，提出一种基于快速傅立叶变换相位和幅度的自相关检测算法对篡改部位进行检测。
To detect the forged parts in a single image with copy-move attack, an autocorrelation detection method based on phase and amplitude spectrum of FFT is proposed.
该方程对任意分布形式的输入光束具有普适性、并便于利用快速傅立叶变换算法实现。
This equation is adapted to any shape's input beam and can be easily realized using fft arithmetic.
在分析傅立叶变换特性的基础上，利用傅立叶变换核的三阶对称性，给出了一种快速傅立叶变换算法。
After analysing the character of Fourier transform, using 3 level symmetry of Fourier Kernel as a new algorithm for fast Fourier transform was proposed.
最后简要介绍了实现3780点快速傅立叶变换(FFT)的算法。其计算复杂度和容量复杂度都与标准的4096点FFT算法相当。
Finally a3780-point FFT algorithm is introduced in brief, whose capacity complexity and computation complexity are close to the conventional4096-point FFT.
实践应用表明，在在线监测系统中应采用快速傅立叶变换算法。
Application result shows that fast Fourier transforms should be adopted in on-line monitoring...
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；
Firstly , the properties of Fourier Transform, including discrete Fourier Transform, FFT and based-2 DIT FFT, are introduced in this paper;
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；
Firstly , the properties of Fourier Transform, including discrete Fourier Transform, FFT and based-2 DIT FFT, are introduced in this paper;
应用推荐