Iterative structure of Winograd FFT algorithm
Xing Qingbin, Zhu Qing, Sun Sheng-he · 1996
A 1D-to-1D mapping is designed to get an iterative structure of the Winograd FFT algorithm (WFTA). With this new representation, the WFTA features a unified computational structure which is the same as that of the Cooley-Tukey algorithm.