混合基fft算法matlab编程,基于FPGA的混合基FFT算法设计与实现

Recently, researches on resource-saving mixed-radix Fast Fourier Transform (FFT) technology with low complexity and high efficiency are of vital importance in digital signal processing. In this paper, we propose and implement a new mixed-radix FFT decomposition algorithm based on FPGA. The proposed in-place algorithm adopts a hybrid decomposition mode combining prime factor factorization algorithm and Cooly-Tukey algorithm, which can save one-step multiplication operation of the rotation factor and also reduce the storage space and operation amount effectively, while it also uses the universal butterfly unit module to accommodate to the radix-2, radix-3, and radix-4 FFT operations. The simulation results indicate that the proposed algorithm can greatly improve the flexibility of FFT processing points and effectively save computing resources.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值