Title :
Automating the design of prime length FFT programs
Author :
Selsnick, I.W. ; Burrus, C.S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
Abstract :
The automatic design of prime-length fast Fourier transforms (FFTs) based on S. Winograd´s (1980) theory is described. A program is described that generates code for FFTs so that longer prime length FFTs that were formerly practical to design are now easily generated. For those prime lengths (⩽19) for which FFTs already exist, the program produces equally efficient FFTs. The new FFT programs generated do not have the minimum number of multiplications but do have a more practical balance between additions and multiplications
Keywords :
digital arithmetic; fast Fourier transforms; additions; automatic design; multiplications; prime length FFT programs; Artificial intelligence; Cathode ray tubes; Convolution; Discrete Fourier transforms; Fast Fourier transforms; Flexible printed circuits; Flow graphs; Polynomials; Process design;
Conference_Titel :
Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-0593-0
DOI :
10.1109/ISCAS.1992.229996
