片上实现高速、高分辨率流水线的基数2 FFT算法

N. Mahdavi, R. Teymourzadeh, M. B. Bin Othman
{"title":"片上实现高速、高分辨率流水线的基数2 FFT算法","authors":"N. Mahdavi, R. Teymourzadeh, M. B. Bin Othman","doi":"10.1109/ICIAS.2007.4658591","DOIUrl":null,"url":null,"abstract":"A new on-chip implementation of fast Fourier transform (FFT) based on Radix 2 is presented. The pipeline and parallel approaches are combined to introduce a new high speed FFT algorithm which increases resolution by using floating point calculations in its structures. The design has the merits of low complexity and high speed performance. Furthermore, latency reduction is an important issue to implement the high speed FFT on FPGA. The proposed FFT algorithm shows the latency of (N/2log2 N) + N. Moreover, this algorithm has the advantage of low mean squared error (MSE) of 0.0001 which is preferable to Radix 2 FFT.","PeriodicalId":228083,"journal":{"name":"2007 International Conference on Intelligent and Advanced Systems","volume":"454 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On-chip implementation of high speed and high resolution pipeline Radix 2 FFT algorithm\",\"authors\":\"N. Mahdavi, R. Teymourzadeh, M. B. Bin Othman\",\"doi\":\"10.1109/ICIAS.2007.4658591\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new on-chip implementation of fast Fourier transform (FFT) based on Radix 2 is presented. The pipeline and parallel approaches are combined to introduce a new high speed FFT algorithm which increases resolution by using floating point calculations in its structures. The design has the merits of low complexity and high speed performance. Furthermore, latency reduction is an important issue to implement the high speed FFT on FPGA. The proposed FFT algorithm shows the latency of (N/2log2 N) + N. Moreover, this algorithm has the advantage of low mean squared error (MSE) of 0.0001 which is preferable to Radix 2 FFT.\",\"PeriodicalId\":228083,\"journal\":{\"name\":\"2007 International Conference on Intelligent and Advanced Systems\",\"volume\":\"454 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Intelligent and Advanced Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAS.2007.4658591\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Intelligent and Advanced Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAS.2007.4658591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种基于Radix 2的快速傅里叶变换(FFT)的片上实现方法。将流水线和并行方法相结合,引入了一种新的高速FFT算法,该算法通过在其结构中使用浮点计算来提高分辨率。该设计具有复杂度低、速度快的优点。此外,降低延迟是在FPGA上实现高速FFT的一个重要问题。所提出的FFT算法的延迟为(N/2log2 N) + N,并且该算法的均方误差(MSE)较低,为0.0001,优于基数2的FFT。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On-chip implementation of high speed and high resolution pipeline Radix 2 FFT algorithm
A new on-chip implementation of fast Fourier transform (FFT) based on Radix 2 is presented. The pipeline and parallel approaches are combined to introduce a new high speed FFT algorithm which increases resolution by using floating point calculations in its structures. The design has the merits of low complexity and high speed performance. Furthermore, latency reduction is an important issue to implement the high speed FFT on FPGA. The proposed FFT algorithm shows the latency of (N/2log2 N) + N. Moreover, this algorithm has the advantage of low mean squared error (MSE) of 0.0001 which is preferable to Radix 2 FFT.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信