Implementation of a 4-Parallel 128-Point Radix-8 FFT Processor via Folding Transformation

Kevin H. Viglianco, Daniel R. Garcia, James J. W. Kunst
{"title":"Implementation of a 4-Parallel 128-Point Radix-8 FFT Processor via Folding Transformation","authors":"Kevin H. Viglianco, Daniel R. Garcia, James J. W. Kunst","doi":"10.1109/CAE56623.2023.10086984","DOIUrl":null,"url":null,"abstract":"This work describes the design and implementation of a 4-parallel 128-point pipelined architecture for the fast Fourier transform (FFT) based on the radix-8 butterfly element using folding transformation and registers minimization techniques. In addition, different optimization stages are obtained by applying multiple optimization techniques, including Canonical Signed Digit (CSD) multipliers, quantization, and pipelining. The final result is a high-speed FFT architecture (up to 1.2GS/s) with a reduced area, power consumption, and latency. Finally, this architecture will be implemented in an open-source FreePDK45 of 45 nm CMOS technology.","PeriodicalId":212534,"journal":{"name":"2023 Argentine Conference on Electronics (CAE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Argentine Conference on Electronics (CAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAE56623.2023.10086984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This work describes the design and implementation of a 4-parallel 128-point pipelined architecture for the fast Fourier transform (FFT) based on the radix-8 butterfly element using folding transformation and registers minimization techniques. In addition, different optimization stages are obtained by applying multiple optimization techniques, including Canonical Signed Digit (CSD) multipliers, quantization, and pipelining. The final result is a high-speed FFT architecture (up to 1.2GS/s) with a reduced area, power consumption, and latency. Finally, this architecture will be implemented in an open-source FreePDK45 of 45 nm CMOS technology.
基于折叠变换的4并行128点基数8 FFT处理器的实现
这项工作描述了基于基数-8蝴蝶元素的快速傅里叶变换(FFT)的4并行128点流水线架构的设计和实现,该架构使用折叠变换和寄存器最小化技术。此外,通过应用多种优化技术,包括规范符号数字(CSD)乘法器、量化和流水线,可以获得不同的优化阶段。最终的结果是一个高速FFT架构(高达1.2GS/s),减少了面积、功耗和延迟。最后,该架构将在45纳米CMOS技术的开源FreePDK45中实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信