小点数Winograd傅里叶变换算法处理器设计

摘要

Winograd Fourier Transform Algorithm(WFTA) is a fast algorithm of small points of DFT applying to the non-two integer power, and its computing speed shows a direct impact on system performance. The paper gives the design of hardware structure according to the actual situation of each small point, which adopts shift register and accumulator-based circuit structure in the WFTA design when the point is 3 or 4; when the point increases to 5, 7 and 9, it adopts the method of addition or subtraction matrix factorization to ensure fast computing speed. The simulation results show that the design scheme meets pipeline requirements, and its data processing capability is strong enough.%　　Winograd 傅里叶变换算法(WFTA)是一种针对非2的整数次幂的小点数离散傅里叶变换(DFT)的快速算法，其运算速度对系统性能具有直接影响。根据各小点数的实际情况，分别进行了硬件结构的设计，在3点和4点的 WFTA 设计中采用移位寄存器和累加器为基础的电路结构，得到了较好的结果；当点数增加到5点、7点和9点时，采用加/减法矩阵分解方法，保证较快的运算速度。通过仿真结果表明，设计方案满足流水线要求，具有较强的数据处理能力。