{"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}
引用次数: 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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
