The Fourier algorithm and its improved algorithm are emphasized.
重点分析了傅氏算法及其改进算法。
The decaying DC component is filtered in the Fourier algorithm, which improves data precision and simplifies hardware circuits.
并采用滤除衰减直流分量的傅氏算法，提高了数据精度、简化了硬件电路。
Currently, a number of methods proposed for calculating the phasors of harmonic components of signals using the Fourier algorithm seem to make electrical engineers puzzled as to which to choose from.
目前有多种采用傅里叶算法求取信号谐波分量相量值的方法，使得工程技术人员无从选择。
The algorithms are extension of Fourier algorithm.
这些算法是富氏算法的推广。
One is the fast Fourier transform (FFT) accelerated algorithm.
一种是快速傅立叶变换(FFT)加速算法。
IBD algorithm is analyzed, and the space IBD method combined with the IBD method based on Fourier transformation is realized.
分析了IBD算法，并实现了空域IBD和利用傅立叶变换的IBD相结合的算法。
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).
核心模块快速傅立叶逆变换（IFFT）采用基于16位定点运算的基-2时间抽取算法和流水线结构。
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 接收机中有着广泛的应用前景。
The decaying DC component in the sampling signal will bring errors to the full-wave Fourier algorithm, which is derived with periodic signal.
全波傅氏算法是基于周期信号推导出来的，当采样信号中含有衰减直流分量时，将会产生误差。
These DOEs are designed with the cascaded iterative Fourier transform(CIFT)algorithm.
这些衍射元件可通过级联迭代傅里叶变化算法设计。
So a new algorithm with rectangle loops Fourier spectral energy percentage is proposed by analyzing the conjugate symmetry of Fourier transform.
因此，根据傅里叶变换的共轭对称性，提出了更具有一般性的长方环傅里叶周向谱能量百分比新算法。
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算法会产生较大的误差。
This paper studies several sorts of improved Fourier algorithm in recent years, particularly analyzes the method of filtering decaying DC component.
对近年来提出的几种改进傅氏算法进行分类研究，着重分析了其滤除衰减直流分量的方法。
In this paper we discuss the mechanism of using Fourier transform on texture identification and then suggest a texture image segmentation algorithm based on Fourier transform.
讨论了傅氏变换应用于纹理识别的机理，并基于此提出了一种图象分割算法。
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)和数字信号调制解调的特点，给出了一种盲信道质量估计算法。
It is shown that the improved algorithm provides more accurate calculation results than the complex Gaussian function expansion, so long as the number of Fourier series is no less than 30.
研究表明，只要傅里叶级数项数不少于30，改进后的算法比直接用复高斯函数展开具有更高的计算精度。
Based on the prime radix DFT and number theory, an algorithm using the second order recursive filter and the zero factor prime radix Fourier Transform (ZFT) is presented.
从素基数DFT出发，应用数论理论讨论了一种应用二阶递归滤波结构的算法及零因子转换算法(ZFT)。
Based on the fast Fourier transform (FFT) algorithm, the wave-front reconstruction algorithm of Shack-Hartmann sensor is described.
提出了一种应用快速傅里叶变换算法提高哈特曼夏克波前传感器波前重构实时性的快速算法。
A study was performed on the PIV algorithm based on fast Fourier transformation (FFT), and the PIV program was compiled and verified.
在粒子图像测速原理的基础上研究了基于快速傅立叶变换的粒子图像测速算法，并编制算法程序进行验证。
This algorithm has utilized the signal to carry on the signal characteristic that Fourier includes in the density of the power spectrum after Fourier transform.
算法利用了信号进行傅里叶变换后功率谱密度中所包含的信号特征在基带完成，并用软件实现。
A new algorithm for array synthesis based on inverse Discrete Fourier Transform (IDFT) is proposed in the paper.
基于逆离散傅立叶变换(IDFT)算法，提出了一种新的阵列综合算法。
The least square algorithm using forward and backward linear prediction (LS algorithm) for the autoregressive spectral estimates of the SMMW Fourier transform spectroscopy data is presented.
本文介绍自回归谱分析法的另一种算法—前后向最小二乘法(LS算法)在亚毫米波付里叶变换谱中的应用。
The "atomic" algorithm performs decoding process using Fourier transformation only once and the integral Fourier transformation works without floating operation.
“原子”解码算法只通过一次傅氏变换即完成解码；而整数傅氏变换避免了傅氏变换中最耗时的浮点运算。
A new algorithm of analysing FM (frequency modulation) interferogram is described. Compared with the Fourier method, it is time saving and suitable for real-time calculation.
本文提出一种无需滤波处理的调频条纹分析算法，该算法与傅里叶技术相比具有省时、便于进行快速、实时位相测量等优点。
An algorithm which USES output of the Fourier filter to measure power system frequency is presented.
提出了一种利用富氏滤波器的输出测量电力系统频率的算法。
MTB algorithm and the Fourier—Mellin algorithm have their own advantages in terms of complexity and robustness in the algorithm.
MTB算法和傅里叶——马林算法在算法的复杂度和鲁棒性方面，都有各自优势。
This paper introduces an affective algorithm in which we make use of the Fourier transform to find out the Discrete Fourier transform, and to explain the usage of this algorithm by examples.
本文介绍一种计算离散付里叶变换的新算法，并通过例子说明这种算法的实用性。
This paper introduces an affective algorithm in which we make use of the Fourier transform to find out the Discrete Fourier transform, and to explain the usage of this algorithm by examples.
本文介绍一种计算离散付里叶变换的新算法，并通过例子说明这种算法的实用性。
应用推荐