一种新的二维DFT并行算法

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

M. Wang, E.B. Lee

{"title":"一种新的二维DFT并行算法","authors":"M. Wang, E.B. Lee","doi":"10.1109/ICSYSE.1990.203140","DOIUrl":null,"url":null,"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","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new parallel algorithm for 2D DFT\",\"authors\":\"M. Wang, E.B. Lee\",\"doi\":\"10.1109/ICSYSE.1990.203140\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":259801,\"journal\":{\"name\":\"1990 IEEE International Conference on Systems Engineering\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1990 IEEE International Conference on Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSYSE.1990.203140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1990 IEEE International Conference on Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSYSE.1990.203140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

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

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A new parallel algorithm for 2D DFT

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1990 IEEE International Conference on Systems Engineering

自引率

0.00%

发文量

期刊最新文献

Robust method of fault detection and diagnosis Optimal parameter identification for reduced-order discrete-time modeling of time-varying systems An experimental investigation and analysis of a brushless DC motor for diskette applications Rohrs examples and robustness of simple adaptive control Implementation of dynamic obstacle avoidance on the CMU NavLab