快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
离散傅里叶变换（DFT）在数字信号处理等许多领域中起着重要作用。
The Discrete Fourier Transform (DFT) plays an important role in digital signal processing and many other fields.
在理想情况下，利用离散傅里叶变换及其性质，能精确恢复原始波面。
By using Fourier transformation, the original wave-front can be recovered with higher precision and in more details.
采用离散傅里叶变换法进行计算，具有设备简单、易操作和计算快捷的特点。
The MTF are calculated by DFT. The method makes the simple equipment to be easy of operation and quick of calculation.
在不求出DOA的情况下，采用离散傅里叶变换来估计该路径下行信道协方差矩阵。
DFT is used to estimate the covariance matrix of downlink channel of the path, not calculating DOA.
常用的离散傅里叶变换(DFT)、离散哈特莱变换(DHT)均可视为DYT的特例。
The discrete Fourier transform (DFT) and discrete Hartley transform (DHT) can be considered as special cases of DYT.
介绍一种基于离散傅里叶变换(DFT)的全方向M型超声心动图运动曲线频域滤波技术。
The paper presents a method of motion curve frequency domain filtering in Omni-directional M-mode echocardiography images based on Discrete Fourier Transform (DFT).
依据离散傅里叶变换性质，推导出离散傅里叶变换的不变特征，并将其用于人脸图像识别。
Then according to the properties of discrete Fourier transform, it deduces the discrete Fourier invariant features that are employed on facial image recognition.
在多点成形过程中，3维曲面形状的离散傅里叶变换描述能够反映成形件的整体变形特性。
With Discrete Fourier Transforms description of 3d curved surface, transform function of forming process is discussed.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
本文证明了时间域内的平稳相关序列经离散傅里叶变换之后，听得到的是频域内的正交随机序列。
This paper proved that a frequency stochastic sequence obtained from a stationarily correlated time series by using discrete Fourier transform is orthogonal.
在讲复数运算之前，我们先来回顾一下实数离散傅里叶变换，强调一下它在某些情况下数学上很笨拙。
Before jumping into the complex math, let's review the real DFT with a special emphasis on things that are awkward with the mathematics.
应用离散傅里叶变换dft，通过MATLAB实现对连续信号频谱分析，以满足理论分析和工程实际的需要。
Application DFT Discrete Fourier Transform, right through MATLAB continuous signal spectrum analysis, in order to meet the theoretical analysis and practical needs.
提出了一种基于机器视觉与离散傅里叶变换的目标特征识别方法。利用计算机图像技术采集和处理图像信号；
A identifying image methods based on machine vision and DFT are studied, The images are collected and video signal is processed using computer technology.
当我们说“频率变换”或者说“代表频率”是我们通常所说的傅里叶变换，如离散傅里叶变换dft实现，或。
When we say "frequency transform" or talk about "representing frequency" we are usually talking about the Fourier transform, implemented as the DFT, or discrete Fourier transform.
从连续傅里叶变换出发，讨论连续傅里叶变换情况下的傅里叶变换性质，给出离散傅里叶变换情况下的傅里叶变换性质。
Starting from continuous Fourier transform, the properties of continuous Fourier transform are discussed, and the paper gives the properties of discrete Fourier transform.
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（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;
离散快速傅里叶变换算法在频谱分析中得到了广泛的应用，这种算法得到的计算结果是在整个频段上的频谱信息。
Discrete fast Fourier transform (FFT) has been widely applied to signal spectral analysis and can figure out the entire bandwidth spectrum of a signal.
重点研究了基于离散短时傅里叶变换解调2FSK信号的方法，分析了几种码元同步算法和码元判决算法。
Secondly, a DSTFT(Discrete Short Time Fourier Transform )-based demodulation method for the 2FSK signal is studied and algorithms for symbol synchronization and symbol decision are analysed.
重点研究了基于离散短时傅里叶变换解调2FSK信号的方法，分析了几种码元同步算法和码元判决算法。
Secondly, a DSTFT(Discrete Short Time Fourier Transform )-based demodulation method for the 2FSK signal is studied and algorithms for symbol synchronization and symbol decision are analysed.
应用推荐