Title :
A method for programming the complex general-N Winograd Fourier transform algorithm
Author :
Silverman, Harvey F.
Author_Institution :
IBM T.J.Watson Research Center, Yorktown Heights, New York
Abstract :
The Winograd Fourier Transform Algorithm (WFTA) requires about 20% of the multiplications used in an optimized FFT, while the number of additions remains unchanged. This paper describes one "General-N" (i.e. many allowable DFT sizes (N) but certainly not any vector size) complex WFTA programming technique.
Keywords :
Costs; Discrete Fourier transforms; Fourier transforms; Mathematical programming; Memory; Radio frequency; Signal processing algorithms;
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '77.
DOI :
10.1109/ICASSP.1977.1170333
