快速离散傅里叶变换算法研究与 FPGA 实现

摘要

This paper puts forward the fast hardware implementation algorithm of the Discrete Fourier Transform suit -able for OFDM, and carries the FPGA implementation of the algorithm .This paper adopts parallel processing struc-ture, effectively improves the calculation speed .The system processing time is 2.6μs.In order to reduce the multipli-er resources , this paper simplifies the operation , reduces the 4 N multiplication operations to N/2 multiplications for each input data.Therefore, in this paper, algorithm implementation time is short, no delay, and the algorithm re-duces the consumption of resources , simplifies the hardware implementation .%提出了适合于OFDM的离散傅里叶变换的快速硬件实现算法，并对算法进行了FPGA实现。采用并行处理结构，有效的提高了计算速度，整个系统处理时间达到2．6μs。为了减少乘法器资源，进行了简化运算，对于每一点输入数据，由4N次乘法运算减少到N／2次乘法运算。因此，此算法实现时间很短，没有延时，降低了资源消耗，硬件实现简单。