A new algorithm for array synthesis based on inverse Discrete Fourier Transform (IDFT) is proposed in the paper.
基于逆离散傅立叶变换(IDFT)算法，提出了一种新的阵列综合算法。
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）。
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.
本文介绍一种计算离散付里叶变换的新算法，并通过例子说明这种算法的实用性。
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.
在众多语音信息隐藏算法中，挑选出一种幅度量化的信息嵌入方案，分别在离散余弦和小波变换域上，通过对变换域系数的幅度量化来隐藏信息；
This algorithm is based on two dimensional discrete Fourier transform (2dft).
该水印算法基于二维离散傅立叶变换(2dft)。
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.
当全部采样点都处理过后，可在基本周期的最后一个时间间隔中得到和离散傅立叶变换一样的结果。
应用推荐