A dynamically configurable-radix pipelined FFT algorithm for real time applications

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.
用于实时应用的动态可配置基数流水线FFT算法
提出了一种具有动态可配置基数处理单元的高效流水线快速傅里叶变换。使用的架构设计是单路径延迟反馈。该设计显著优化了乘数器的延迟和硬件利用率,达到87.5%,结构简单,成本低。所建议的架构是可扩展的,可以使用额外的阶段支持1024个点的倍数。该设计在FPGA上实现。此外,可以添加额外的级以达到任何FFT尺寸。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信