摘要
详细介绍基2时间抽取快速傅立叶变换(DIT-FFT)的基本原理,在深入研究蝶形运算的基础上,针对蝶形运算中数据和运算参数地址选取的复杂性问题,通过对三个简易计数器的设计,解决蝶形运算中复杂的地址选取操作,使蝶形运算过程简单化,最后基于FPGA平台对基2DIT-FFT蝶形运算的存储器模块和计数器模块进行仿真实现。
Abtract:In this paper, the basic principle of radix-2 Decimation in Time Fast Fourier Transform(DIT-FFT) is introduced in detail. Aiming at the complexity of address selection of data and operation parameters in the butterfly operation, three simple counters are designed to solve the complex address selection and simplify the process on the basis of in-depth study of the butterfly operation. Finally, the memory module and counter module of radix-2 DIT-FFT butterfly operation are simulated based on FPGA platform.
作者
梁东
Liang dong(Communication and Network Institute,Shenyang Ligong University,Liaoning,Shenyang,110159,China)
出处
《信息通信》
2020年第7期41-43,共3页
Information & Communications
