在图像灰度分布互相关和快速傅立叶变换的基础上，研究了粒子图像测速的实现。
On the basis of image cross correlation of brightness distribution and Fast Fourier Translation, the implementation of Particle image Velocimetry was studied.
用波数域的位场转换和快速傅立叶变换理论研究重力归一化总梯度和归一化相位；
The normalized full gradient and phase of gravity anomalies have been studied by potential field conversion and fast Fourier transform in wave-number domain.
数字信号处理器(dsp)是鉴于数字滤波和快速傅立叶变换的数字信号处理技术。
Digital signal processor (DSP) is used to meet the need of digital signal processing technique, such as digital filer and FFT.
在求解过程中应用共轭梯度法(CGM)和快速傅立叶变换(FFT)相结合的方法降低所需计算机内存和CPU时间。
The conjugate gradient method (CGM) and fast Fourier transform (FFT) technique are used to reduce the necessary memory and CPU time.
快速傅立叶变换、滑动窗口和某些Linux音频编程可以为您提供符合您所选语言的音调识别能力。
Fast Fourier transforms, sliding percentage Windows, and some Linux audio programming can give you tonal-recognition capabilities with your language of choice.
采用快速傅立叶变换(FFT)进行电力系统谐波分析时，需要对采样信号截断并离散化，从而导致频谱泄漏和栅栏效应。
Fast Fourier Transform (FFT) is inevitable to cause the spectrum leakage and fence effect because of truncation and discreteness in signal collection.
核心模块快速傅立叶逆变换（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).
离散傅立叶变换方法能够在DSP平台上通过FFT快速实现，而循环相关方法则具有很高的频率估计精度和很好的抗噪性能。
DFT method can be fast implemented on DSP platform by the use of FFT algorithm, while the method of cyclic correlation has better noise immunity performance and high estimation accuracy.
本文介绍一种实现傅立叶快速变换的8031单片系统，并给出该系统实时显示和分析超声多普勒血流信号声谱的一些结果。
Fudan University In this paper a 8031 single-chip system for FFT is described. Some results of real-time display and analysis of ultrasound Doppler flow sonography using this system are also given.
针对一类单幅图像的复制遮盖篡改，提出一种基于快速傅立叶变换相位和幅度的自相关检测算法对篡改部位进行检测。
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.
针对此问题，笔者提出了一种基于快速傅立叶变换和功率谱密度计算的解决方法。
Aiming at this problem, an effective method based on FFT and power spectral density computing has been put forward.
本文研究了基2的时域抽取快速傅立叶变换各阶段的并行性，并据此设计了相应的蝶形和倒序运算核，在GPU上实现了二维fft运算。
This paper studies the parallelism of the different stages of decimation in time radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2d FFT on GPU.
并利用快速傅立叶变换方法对谐波、闪变和纯正弦波等稳态现象进行分析。
As to steady state phenomena, the traditional signal analysis tool FFT is used for harmonic analysis and flicker.
最后简要介绍了实现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.
最后简要介绍了实现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.
应用推荐