Benjamin Shokry, M. Dessouky, M. Safar, M. El-Kharashi
{"title":"A dynamically configurable-radix pipelined FFT algorithm for real time applications","authors":"Benjamin Shokry, M. Dessouky, M. Safar, M. El-Kharashi","doi":"10.1109/ICCES.2017.8275340","DOIUrl":null,"url":null,"abstract":"An efficient pipelined Fast Fourier Transform with a dynamically configurable-radix processing element is presented. The architectural design used is the single-path delay feedback. The proposed design significantly optimizes the latency and the hardware utilization of multipliers to 87.5% with a simple and low cost architecture. The proposed architecture is scalable to support multiples of 1024 points using additional stages. The proposed design was implemented on an FPGA. Furthermore, additional stages could be added to reach any FFT size.","PeriodicalId":170532,"journal":{"name":"2017 12th International Conference on Computer Engineering and Systems (ICCES)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Computer Engineering and Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2017.8275340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
An efficient pipelined Fast Fourier Transform with a dynamically configurable-radix processing element is presented. The architectural design used is the single-path delay feedback. The proposed design significantly optimizes the latency and the hardware utilization of multipliers to 87.5% with a simple and low cost architecture. The proposed architecture is scalable to support multiples of 1024 points using additional stages. The proposed design was implemented on an FPGA. Furthermore, additional stages could be added to reach any FFT size.