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），它把一个信号分解成它的组成频率，并表示成一个矩阵。
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)—显示了在汇编不同汇编器选项时的改善结果。
The Discrete Fourier Transform (DFT) plays an important role in digital signal processing and many other fields.
离散傅里叶变换（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）。
The direct DFT based channel estimation method uses comb-type pilot symbol and discrete Fourier transform (DFT) to estimate the channel.
有一种直接基于DFT的信道估计方法利用均匀梳状分布的导频符号和离散傅立叶变换（DFT）完成信道估计。
The discrete Fourier transform (DFT) and discrete Hartley transform (DHT) can be considered as special cases of DYT.
常用的离散傅里叶变换(DFT)、离散哈特莱变换(DHT)均可视为DYT的特例。
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型超声心动图运动曲线频域滤波技术。
Making use of the advantage of the FDSP in the digital signal processing, we can optimize and improve discrete Fourier transform (DFT) in order to acquire the characteristic variables of the signal.
利用FDSP在数字信号处理上的优势，优化改进了离散傅立叶变换(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.
当我们说“频率变换”或者说“代表频率”是我们通常所说的傅里叶变换，如离散傅里叶变换dft实现，或。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
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)进行图象复原的方法。
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.
当全部采样点都处理过后，可在基本周期的最后一个时间间隔中得到和离散傅立叶变换一样的结果。
In the field of signal analysis, the DFT (Discrete Fourier Transform) is a well known term.
在信号分析领域，DFT(离散傅立叶变换)是一个常见术语。
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)调制滤波器组的原型滤波器设计方法。
Application DFT Discrete Fourier Transform, right through MATLAB continuous signal spectrum analysis, in order to meet the theoretical analysis and practical needs.
应用离散傅里叶变换dft，通过MATLAB实现对连续信号频谱分析，以满足理论分析和工程实际的需要。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
应用推荐