Optimized iterative WFTA method for the 3780-point FFT scheme
Jinan Leng, Lei Xie, Huifang Chen, Kuang Wang · 2011
In this paper, the classical Winograd Fourier transform algorithm (WFTA) is analyzed in 2-D DFT form. A common method is deduced to build the mapping matrix for the iterative WFTA, which is used to optimize the 3780-point FFT processor in the TDS-OFDM scheme. In this optimized scheme, mapping addresses for the reorder RAMs are replaced by a generator, which saves 181,400 bits of the ROM storage. The analysis and simulation results show that the proposed scheme reduces 45% multiplications in the computational complexity, and it consumes lower hardware resources than the existing designs. The proposed design satisfies the requirement of the Chinese Digital Terrestrial/Television Multimedia Broadcasting (DTMB) standard.