Search - fft algorithm assembly

Search - fft algorithm assembly - List

[Other] _used DL : 0: 在分析了快速傅里叶算法理论的基础上，提出了一种频率抽取基4FFT的FPGA设计方案，针对现有FFT的 FPGA实现过程中蝶形运算需要频繁乘以多个旋转因子提出了改进方法，减少了旋转因子的乘法次数和存储空间，加快了蝶形运算的速度，设计的地址映射方法，无需运算即可得到所需数据的存放地址，并结合采用乒乓结构和流水线方式，来提高快速傅里叶变换(FFT)FPGA实现的速度，为实现FFT算法提供了一定的参考价值。-In the analysis of the fast Fourier algorithm based on the theory proposed a frequency extraction 4FFT FPGA-based design, the FPGA implementation for existing FFT butterfly operations that require frequent during the rotation factor multiplied by the number of proposed improved method , reducing the number of twiddle factor multiplication and storage space, speed up the butterfly computing speed, design, address mapping method, the required data can be obtained without computing the storage address and a combination of ping-pong structure and assembly line methods to increase rapidly Fourier Transform (FFT) FPGA to achieve the speed, in order to achieve the FFT algorithm provides a certain reference value.
Date : 2025-12-30 Size : 368kb User : wk