重用较小的优化FFT块以实现更大的节能基数-2 FFT

S. Ghissoni, E. Costa, R. Reis
{"title":"重用较小的优化FFT块以实现更大的节能基数-2 FFT","authors":"S. Ghissoni, E. Costa, R. Reis","doi":"10.1109/PATMOS.2015.7347603","DOIUrl":null,"url":null,"abstract":"This paper reports the reuse of smaller optimized FFT (Fast Fourier Transform) blocks for the realization of larger power efficient radix-2 FFTs. The smaller FFT blocks use Constant Matrix Multiplication (CMM) method along its stages that are implemented with Carry Save Adders (CSA). The use of CMM at gate level enables the replacement of the multiplication operations by addition/subtractions and shifts for each stage of the real and imaginary parts of the FFT butterflies. The larger FFT is obtained through the composition of the optimized smaller FFT modules. Through a control unit, the partial decomposition of coefficients allows the computation of all coefficients necessary for the larger FFTs. The use of pipeline into the stages of the FFT enabled gains in both power and performance when compared with the previous non-pipelined solution. Moreover, the results showed that, when using pipeline, our solution is more delay and power efficient when compared with prominent works from the literature.","PeriodicalId":325869,"journal":{"name":"2015 25th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Reusing smaller optimized FFT blocks for the realization of larger power-efficient radix-2 FFTs\",\"authors\":\"S. Ghissoni, E. Costa, R. Reis\",\"doi\":\"10.1109/PATMOS.2015.7347603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper reports the reuse of smaller optimized FFT (Fast Fourier Transform) blocks for the realization of larger power efficient radix-2 FFTs. The smaller FFT blocks use Constant Matrix Multiplication (CMM) method along its stages that are implemented with Carry Save Adders (CSA). The use of CMM at gate level enables the replacement of the multiplication operations by addition/subtractions and shifts for each stage of the real and imaginary parts of the FFT butterflies. The larger FFT is obtained through the composition of the optimized smaller FFT modules. Through a control unit, the partial decomposition of coefficients allows the computation of all coefficients necessary for the larger FFTs. The use of pipeline into the stages of the FFT enabled gains in both power and performance when compared with the previous non-pipelined solution. Moreover, the results showed that, when using pipeline, our solution is more delay and power efficient when compared with prominent works from the literature.\",\"PeriodicalId\":325869,\"journal\":{\"name\":\"2015 25th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 25th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PATMOS.2015.7347603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 25th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PATMOS.2015.7347603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文报告了重用较小的优化FFT(快速傅里叶变换)块以实现更大的功率效率的基数-2 FFT。较小的FFT块沿其阶段使用恒定矩阵乘法(CMM)方法,该方法由进位保存加法器(CSA)实现。在门级使用CMM可以通过FFT蝴蝶的实部和虚部的每个阶段的加法/减法和移位来替换乘法操作。更大的FFT是由优化后的小FFT模块组成的。通过控制单元,系数的部分分解允许计算较大fft所需的所有系数。与之前的非流水线解决方案相比,在FFT的各个阶段使用流水线技术可以在功率和性能方面获得提升。结果表明,在使用流水线的情况下,我们的解决方案比文献中的优秀作品具有更高的延迟和功耗效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reusing smaller optimized FFT blocks for the realization of larger power-efficient radix-2 FFTs
This paper reports the reuse of smaller optimized FFT (Fast Fourier Transform) blocks for the realization of larger power efficient radix-2 FFTs. The smaller FFT blocks use Constant Matrix Multiplication (CMM) method along its stages that are implemented with Carry Save Adders (CSA). The use of CMM at gate level enables the replacement of the multiplication operations by addition/subtractions and shifts for each stage of the real and imaginary parts of the FFT butterflies. The larger FFT is obtained through the composition of the optimized smaller FFT modules. Through a control unit, the partial decomposition of coefficients allows the computation of all coefficients necessary for the larger FFTs. The use of pipeline into the stages of the FFT enabled gains in both power and performance when compared with the previous non-pipelined solution. Moreover, the results showed that, when using pipeline, our solution is more delay and power efficient when compared with prominent works from the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive energy minimization of embedded heterogeneous systems using regression-based learning Energy management via PI control for data parallel applications with throughput constraints Energy-efficient Level Shifter topology Asynchronous sub-threshold ultra-low power processor Combining Pel Decimation with Partial Distortion Elimination to increase SAD energy efficiency
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1