DFTs

Secondly was got it was to generalized the case of multi-variable polynomial, which provided a new method of computing M-D DFTs and M-D convolutions.

首先给出了二元的情况，然后推广到了一般多元多项式乘积的情况，这为计算多维卷积和多维DFT提供了新的途径。

互联网摘选

In this paper, we mainly discuss error problem which was brought about by fast speed realization of recursively computing DFTs.

离散快速傅里叶变换算法在频谱分析中得到了广泛的应用，这种算法得到的计算结果是在整个频段上的频谱信息。

互联网摘选

Then, the mission availability models of DIBS and distributed fault-tolerant system ( DFTS) are set up separately.

然后从任务可用度的角度出发，分别建立分布式互备份系统与分布式容错系统的任务可用度模型。

互联网摘选

Error Analysis and High Precision Realization of Fast Speed Recursive DFTs

快速递归傅里叶变换的误差分析及高精度实现

互联网摘选

Very High Speed Deconvolution Based on the Recursively Computing DFTs

基于递归计算DFT的反卷积高速算法

互联网摘选

A Polynomial Transform Method for Computing 2-D Convolutions and DFTs

计算二维卷积和DFT的多项式变换方法

互联网摘选

The simultaneous determination of n, K and d by means of DFTs

基于色散傅里叶变换光谱学原理的n、k、d同时测定方法

互联网摘选