On the design of the FFT Butterfly Units

Fotis Douskas, K. Pekmestzi
{"title":"On the design of the FFT Butterfly Units","authors":"Fotis Douskas, K. Pekmestzi","doi":"10.1109/MOCAST.2017.7937635","DOIUrl":null,"url":null,"abstract":"In this paper, efficient designs of the Fast Fourier Transform (FFT) Decimation-in-Time (DIT), radix-2, Butterfly Unit are proposed. Several techniques are incorporated in order to achieve higher performance. The operations are fused by keeping the intermediate variables in Carry-Save format. Besides of the conventional, the Gauss complex multiplication algorithm is also explored. Considered that the twiddle factors cosϕ, sinϕ used in FFT algorithm are constant numbers, we apply to them a special NR4SD encoding scheme with the following sets of digit values: {−2, −1, 0, +1}. Finally, to increase the operation speed, one level of pipelining is introduced in all designs. We implement four designs: one conventional and three new Butterfly Units. In all cases, the proposed three schemes are superior in terms of operation speed, area and power, compared to the conventional.","PeriodicalId":202381,"journal":{"name":"2017 6th International Conference on Modern Circuits and Systems Technologies (MOCAST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Modern Circuits and Systems Technologies (MOCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOCAST.2017.7937635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, efficient designs of the Fast Fourier Transform (FFT) Decimation-in-Time (DIT), radix-2, Butterfly Unit are proposed. Several techniques are incorporated in order to achieve higher performance. The operations are fused by keeping the intermediate variables in Carry-Save format. Besides of the conventional, the Gauss complex multiplication algorithm is also explored. Considered that the twiddle factors cosϕ, sinϕ used in FFT algorithm are constant numbers, we apply to them a special NR4SD encoding scheme with the following sets of digit values: {−2, −1, 0, +1}. Finally, to increase the operation speed, one level of pipelining is introduced in all designs. We implement four designs: one conventional and three new Butterfly Units. In all cases, the proposed three schemes are superior in terms of operation speed, area and power, compared to the conventional.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
浅谈FFT蝶形单元的设计
本文提出了快速傅里叶变换(FFT)实时抽取(DIT)、基数-2、蝴蝶单元的有效设计。为了获得更高的性能,采用了几种技术。通过将中间变量保持在Carry-Save格式来融合操作。除了传统的复乘法算法外,还对高斯复乘法算法进行了探讨。考虑到FFT算法中使用的旋转因子cosφ, sinφ是常数,我们对它们采用特殊的NR4SD编码方案,其数字值为{−2,−1,0,+1}。最后,为了提高操作速度,在所有设计中都引入了一级流水线。我们实施了四种设计:一种传统的和三种新的蝴蝶装置。在所有情况下,所提出的三种方案在运行速度、面积和功耗方面都优于常规方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A smart phone image processing application for plant disease diagnosis Pole-zero estimation and analysis of op-amp design with negative Miller compensation Design of LVDS driver and receiver in 28 nm CMOS technology for Associative Memories A dual band antenna based on a Quarter Mode Substrate Integrated Waveguide Dead-beat synchronization control in discrete-time chaotic systems
×
引用
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