Design of mixed-radix FFT algorithm based on FPGA

Zhou Ying-xi, Shao Lei
{"title":"Design of mixed-radix FFT algorithm based on FPGA","authors":"Zhou Ying-xi, Shao Lei","doi":"10.1109/CCISP55629.2022.9974269","DOIUrl":null,"url":null,"abstract":"With the rapid development of digital signal processing technology in image processing, radar, communication, fast Fourier transform (FFT) has important research significance. FFT is a fast algorithm of discrete Fourier Transform (DFT). Based on FPGA chip, this paper implements FFT of 256 and 1024 points using pipeline architecture by combining the Mixed-Radix algorithm and Cooly-Tukey algorithm. The main work of this paper includes the optimization of data uploading and storage in FPGA chip, the architecture analysis of mixed-radix algorithm implementation, and the improvement of FFT data computing architecture. Full use of FPGA parallel processing, easy programming implementation, pipeline processing architecture and other advantages to achieve high-speed FFT calculation.","PeriodicalId":431851,"journal":{"name":"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Communication, Image and Signal Processing (CCISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCISP55629.2022.9974269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of digital signal processing technology in image processing, radar, communication, fast Fourier transform (FFT) has important research significance. FFT is a fast algorithm of discrete Fourier Transform (DFT). Based on FPGA chip, this paper implements FFT of 256 and 1024 points using pipeline architecture by combining the Mixed-Radix algorithm and Cooly-Tukey algorithm. The main work of this paper includes the optimization of data uploading and storage in FPGA chip, the architecture analysis of mixed-radix algorithm implementation, and the improvement of FFT data computing architecture. Full use of FPGA parallel processing, easy programming implementation, pipeline processing architecture and other advantages to achieve high-speed FFT calculation.
基于FPGA的混合基数FFT算法设计
随着数字信号处理技术在图像处理、雷达、通信等领域的迅速发展,快速傅里叶变换(FFT)具有重要的研究意义。FFT是一种快速的离散傅里叶变换(DFT)算法。本文基于FPGA芯片,结合mix - radix算法和Cooly-Tukey算法,采用流水线架构实现了256点和1024点的FFT。本文的主要工作包括FPGA芯片中数据上传和存储的优化,混合基数算法实现的架构分析,FFT数据计算架构的改进。充分利用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学术官方微信