Basic theory of spectrum analysis and Fast Fourier Transform (FFT) algorithm are briefly introduced.
简介了频谱分析的基础理论和快速傅利叶变换(FFT)算法。
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)和数字信号调制解调的特点，给出了一种盲信道质量估计算法。
A new algorithm which performs Fourier transform smoothing has been presented and applied to data of staircase voltammetry.
本文提出一种新的富里叶变换平滑算法并应用于处理阶梯扫描伏安法的实验数据。
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 接收机中有着广泛的应用前景。
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.
讨论了傅氏变换应用于纹理识别的机理，并基于此提出了一种图象分割算法。
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算法)在亚毫米波付里叶变换谱中的应用。
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.
算法利用了信号进行傅里叶变换后功率谱密度中所包含的信号特征在基带完成，并用软件实现。
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.
本文介绍一种计算离散付里叶变换的新算法，并通过例子说明这种算法的实用性。
Based on the fast Fourier transform (FFT) algorithm, the wave-front reconstruction algorithm of Shack-Hartmann sensor is described.
提出了一种应用快速傅里叶变换算法提高哈特曼夏克波前传感器波前重构实时性的快速算法。
Employing the Fast Fourier Transform Algorithm (FFT) to determine the initial tap coefficients of equalizers is fundamentally different from using the current iteration method.
用快速离散傅立叶变换(FFT)的方法确定均衡器的初始抽头系数，它区别于目前常用的迭代算法。
So a new algorithm with rectangle loops Fourier spectral energy percentage is proposed by analyzing the conjugate symmetry of Fourier transform.
因此，根据傅里叶变换的共轭对称性，提出了更具有一般性的长方环傅里叶周向谱能量百分比新算法。
It is an approximate algorithm of continuous Fourier transform in which some approaching functions of segments are approximately used instead of continuous functions.
它是一种用分段逼近函数近似代替连续函数，作连续傅氏变换的近似算法。
After analysing the character of Fourier transform, using 3 level symmetry of Fourier Kernel as a new algorithm for fast Fourier transform was proposed.
在分析傅立叶变换特性的基础上，利用傅立叶变换核的三阶对称性，给出了一种快速傅立叶变换算法。
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算法。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
This paper selects the algorithm by quantifying the amplitude of the transform domain coefficient and uses this algorithm in the discrete Fourier domain and the discrete cosine domain.
在众多语音信息隐藏算法中，挑选出一种幅度量化的信息嵌入方案，分别在离散余弦和小波变换域上，通过对变换域系数的幅度量化来隐藏信息；
When all the sample points are handled after the basic cycle of a time interval finally received and discrete Fourier transform as a result of the introduction of DFT algorithm and the Z-transform.
当全部采样点都处理过后，可在基本周期的最后一个时间间隔中得到和离散傅立叶变换一样的结果。
When all the sample points are handled after the basic cycle of a time interval finally received and discrete Fourier transform as a result of the introduction of DFT algorithm and the Z-transform.
当全部采样点都处理过后，可在基本周期的最后一个时间间隔中得到和离散傅立叶变换一样的结果。
应用推荐