One method is phase difference correction of partly FFT; the other is FFT frequency correction with quadratic interpolation.
一是利用分段FFT的相位差修正算法，二是基于二次内插的频率FF T校正法。
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算法会产生较大的误差。
FFT is a very important algorithm in digital signal processing, and butterfly operation modules are important construction modules in FFT processor.
FFT是数字信号处理中的一种非常重要的算法，蝶形运算模块是FFT处理其中的重要构造模块。
On the basis of traditional serial FFT algorithms, a parallel FFT algorithm based on multi-threading is put forward.
在传统的串行FFT算法基础上提出了一种基于多线程技术的并行FFT算法。
The FFT processer adopts the pipeline and parallel technology and can complete 64 points FFT computation in 64 clocks. It is able to meet the need of OFDM system.
本文设计的FFT处理器采用流水线和并行处理技术，在64个时钟周期完成64点复数定点FFT运算，可以满足OFDM系统的需要。
The work module of FFT Unit is designed. Optimizing the FFT algorithms and analyzing the value from the optimized algorithms.
设计了FFT单元的工作模式，优化了FFT算法并分析了优化FFT 算法带来的好处。
The simulation results show that compared with the traditional FFT method, correlation wavelet method exhibits obvious advantages over FFT method, and the accuracy of the results is greatly improved.
结果表明，相关小波法比FFT方法具有更明显的优势，获得了更高精度的脉冲响应函数和频响函数的提取。
The synthesis results show this FFT structure can run at 52mhz clock rate in XC4025E - 2. This FFT structure is easy to expand more points FFT structure.
从综合的结果看该结构可在XC 4025e-2上以52mhz的时钟高速运行。在此基础上易于扩展为大点数fft运算结构。
FFT algorithm is the most used algorithm for digital signal processing, and a FFT processor is one of the important means for FFT computation.
FFT算法是数字信号处理最常用算法，使用FFT处理器是进行FFT运算的重要手段之一。
Harmonic analysis usually adopts FFT algorithm, the 280 Sample points need interpolation management, which make FFT faster.
谐波分析通常采用FFT算法，为了加快FFT的运算速度，需要对280个采样点进行插值处理。
It is proved in the experiments that the improved architecture not only guarantees the velocity of FFT butterfly but also economizes the chip resources and ADAPTS to FFT chip design.
实验证明，这种改进结构既保证了蝶形运算的速度，又节约了芯片资源，适合在FFT芯片设计中使用。
For example, FFT-FT, two times FFT and octave using in sound measure. All this improvement makes PDM2000 system more perfect.
如可以无限细化的FFT - FT方法，二次FFT以及把倍频程应用到声压级测量中，使PDM2000系统更完善。
At last the FP operation modules are used to design FP FFT processor, achieve high precision of FFT processing on FPGA.
最后应用浮点运算模块设计浮点FFT处理器，在FPGA中实现高精度的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.
本文研究了基2的时域抽取快速傅立叶变换各阶段的并行性，并据此设计了相应的蝶形和倒序运算核，在GPU上实现了二维fft运算。
The paper also advanced the method to achieve the convolution through FFT in digital filters and gave the improved formula to achieve FFT as well as the detailed programming steps.
提出了用FFT实现数字滤波中的卷积计算，给出了改进的快变计算公式及用汇编语言编程的具体方法。
In addition, the FFT method is immune to the background noise of the signal, so that the process of signal-processing by the FFT method can advanced.
另外，快速傅里叶变换方法由于不受本底噪声影响，可以不必在信号处理时去掉本底噪声，因而可以明显缩短测量时间。
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算法。
The FFT algorithm is used to realize wave molding. The deep-water waves, shallow water waves, surface waves are molded by the FFT algorithm.
在水波建模方面，本文除了用FFT算法来实现水波建模，还给出了深水波、浅水波、表面波在FFT算法基础上的实现。
This paper uses FFT principles when analyzing the signal in the DSP, so it elaborates the realization technique of FFT which used in fixed-point DSP.
本论文利用FFT原理在DSP上对信号进行分析处理，对于定点DSP中FFT的实现技术作了重点讲述。
This FFT algorithm can be used with arbitrary integer dimensions. For 1-dimension, the algorithm will be simplified as the well-known DIF vector radix 2 FFT.
该FFT算法适合于维数为任意整数的情况，当维数为1时，算法退化为著名的频域抽取向量基2 FFT算法。
The comparison results show that, compared with multi-dimensional separable FFT, the DIF multi-dimensional vector radix FFT algorithm has lower calculation load.
计算量比较结果显示，频域抽取多维向量基FFT算法比多维分离式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算法相当。
According to different situations the FFT algorithm is applied to. three types of fix-point, floating-point and block-floating-point complex FFT algorithms are presented.
根据不同的应用场合，分别实现了定点、浮点和块浮点三种数据格式的复数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.
目前已有的电力谐波监测系统大多采用基于快速傅立叶变换（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;
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；
应用推荐