Warped Discrete Fourier Transform (WDFT);
翘曲离散傅立叶变换；
This algorithm is based on two dimensional discrete Fourier transform (2dft).
该水印算法基于二维离散傅立叶变换(2dft)。
The discrete Fourier Transform of the variables is computed with the FFT of fixed points.
求变数的离散富氏变换用固定点数的FFT，节省了计算时间。
In the field of signal analysis, the DFT (Discrete Fourier Transform) is a well known term.
在信号分析领域，DFT(离散傅立叶变换)是一个常见术语。
It can be taken as a kind of discrete signal and do spectrum analysis by discrete Fourier transform.
在计算生物学中，常采用离散傅立叶变换进行频谱分析。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
The Discrete Fourier Transform (DFT) plays an important role in digital signal processing and many other fields.
离散傅里叶变换（DFT）在数字信号处理等许多领域中起着重要作用。
A new algorithm for array synthesis based on inverse Discrete Fourier Transform (IDFT) is proposed in the paper.
基于逆离散傅立叶变换(IDFT)算法，提出了一种新的阵列综合算法。
The discrete Fourier transform (DFT) and discrete Hartley transform (DHT) can be considered as special cases of DYT.
常用的离散傅里叶变换(DFT)、离散哈特莱变换(DHT)均可视为DYT的特例。
With Discrete Fourier Transforms description of 3d curved surface, transform function of forming process is discussed.
在多点成形过程中，3维曲面形状的离散傅里叶变换描述能够反映成形件的整体变形特性。
The direct DFT based channel estimation method uses comb-type pilot symbol and discrete Fourier transform (DFT) to estimate the channel.
有一种直接基于DFT的信道估计方法利用均匀梳状分布的导频符号和离散傅立叶变换（DFT）完成信道估计。
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算法；
This paper describes a new method which USES IDFT (Inverse Discrete Fourier Transform) technique to do time domain near field measurement for antenna.
本文提出了一种利用离散付立叶反变换(IDFT)技术完成天线的时域近场测量的方法。
A novel design method for the prototype filters of a Near Perfect Reconstruction (NPR) Discrete Fourier Transform (DFT) modulated filter bank is proposed.
提出了一种新的近似完全重构(npr)离散傅立叶变换(DFT)调制滤波器组的原型滤波器设计方法。
In this paper, the method for carrying out the image reconstruction by means of the 2-dimensional discrete Fourier transform (DFT) is introduced in detail.
本文详细地介绍了利用二维离散付里叶变换(DFT)进行图象复原的方法。
This paper proved that a frequency stochastic sequence obtained from a stationarily correlated time series by using discrete Fourier transform is orthogonal.
本文证明了时间域内的平稳相关序列经离散傅里叶变换之后，听得到的是频域内的正交随机序列。
Then according to the properties of discrete Fourier transform, it deduces the discrete Fourier invariant features that are employed on facial image recognition.
依据离散傅里叶变换性质，推导出离散傅里叶变换的不变特征，并将其用于人脸图像识别。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
The paper presents a method of motion curve frequency domain filtering in Omni-directional M-mode echocardiography images based on Discrete Fourier Transform (DFT).
介绍一种基于离散傅里叶变换(DFT)的全方向M型超声心动图运动曲线频域滤波技术。
Application DFT Discrete Fourier Transform, right through MATLAB continuous signal spectrum analysis, in order to meet the theoretical analysis and practical needs.
应用离散傅里叶变换dft，通过MATLAB实现对连续信号频谱分析，以满足理论分析和工程实际的需要。
Study two of the most important basic operations in digital image processing: 2-D Discrete Fourier Transform and 2-D Discrete Convolution Transform. Map them on RCA.
研究了数字图像处理中两种最常用的算子——离散二维傅立叶变换和离散二维卷积，并给出了它们在RCA上的映射策略和映射过程。
Starting from continuous Fourier transform, the properties of continuous Fourier transform are discussed, and the paper gives the properties of discrete Fourier transform.
从连续傅里叶变换出发，讨论连续傅里叶变换情况下的傅里叶变换性质，给出离散傅里叶变换情况下的傅里叶变换性质。
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.
当我们说“频率变换”或者说“代表频率”是我们通常所说的傅里叶变换，如离散傅里叶变换dft实现，或。
The standard method for spectrum analysis in digital signal processing is the discrete Fourier transform(DFT), typically implemented using a fast Fourier transform(FFT) algorithm.
数字信号处理中标准的频谱分析方法是离散傅立叶变换（DFT），典型的实现方法是快速傅立叶变换（FFT）。
What follows is a case study of an actual application - a discrete Fourier transform (DFT) - showing the performance improvements that result when compiling with various compiler options.
接下来的部分是一个实际程序的范例—一个离散的Fourier转变(DFT)—显示了在汇编不同汇编器选项时的改善结果。
One of the most common digital-signal-processing techniques is the discrete Fourier transform (DFT), which breaks a signal into its component frequencies and can be represented as a matrix.
最常见的数字信号处理技术之一是离散傅立叶变换（DFT），它把一个信号分解成它的组成频率，并表示成一个矩阵。
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.
本文介绍一种计算离散付里叶变换的新算法，并通过例子说明这种算法的实用性。
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.
当全部采样点都处理过后，可在基本周期的最后一个时间间隔中得到和离散傅立叶变换一样的结果。
应用推荐