基于FPGA高速并行FFT处理器设计与实现

在研究快速傅里叶变换(FFT)算法的基础上,根据FPGA性能高、灵活性强、速度快的特点,提出了高效的基4-FFT处理器的实现方法。数据存储采用分块存储的方法,大大提高了存取速度。数据寻址采用新型的地址产生方法,可并行产生所需数据地址。同时,在蝶形单元的设计中很好的将并行运算技术和流水线技术相结合了起来,又进一步提高了运算速度。测试结果表明,时钟在50MHz时完成1024点FFT的时间为25.6μs,满足了应用实时性的要求。

Based on the research of fast Fourier transform(FFT) algorithm and the characteristic of FPGA with high-performance strong flexibility and high speed an efficient radix 4-FFT algorithm is proposed Block storage reduces the time for reading and writing data form memories Data addressing employs a novel method which can generate the required data address Meanwhile combination of parallel data processing with multilevel pipeline processing in the process of butterfly unit design makes the operation speed impro...