A new parallel algorithm for 2D DFT

1990 IEEE International Conference on Systems Engineering Pub Date : 1990-08-09 DOI:10.1109/ICSYSE.1990.203140

M. Wang, E.B. Lee

引用次数: 0

Abstract

A 2D fast Fourier transform (FFT) algorithm is described. This algorithm offers a way to do 2D FFTs in both dimensions simultaneously. The amount of computation is reduced compared to traditional algorithms. Due to its good parallelism, a special arrangement of parallel processors saves a great deal of running time. This algorithm can be extended to discrete-time Fourier transforms in more than two dimensions

查看原文本刊更多论文

一种新的二维DFT并行算法

介绍了一种二维快速傅里叶变换(FFT)算法。该算法提供了一种同时在两个维度上进行二维fft的方法。与传统算法相比，减少了计算量。由于其良好的并行性，并行处理器的特殊安排节省了大量的运行时间。该算法可以推广到二维以上的离散时间傅里叶变换

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1990 IEEE International Conference on Systems Engineering

自引率

0.00%

发文量