Automatic Generation of Prime Length FFT Programs
Ivan W. Selesnick and C. S. Burrus
Department of Electrical and Computer Engineering - MS 366,
Rice University, Houston, TX 77251-1892, USAemail: selesi@rice.edu, csb@rice.edu
IEEE Transactions on Signal Processing,
Volume 44, Number 1
pages 14-24, Jan 1996Abstract
We describe a set of programs for circular convolution and prime length FFTs that are short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the structure of the algorithms and clearly enumerate independent computational branches that can be performed in parallel. Moreover, each of these independent operations is made up of a sequence of sub-operations which can be implemented as vector/parallel operations. This is in contrast with previously existing programs for prime length FFTs: they consist of straight line code, no code is shared between them, and they can not be easily adapted for vector/parallel implementations.
We have also developed a program that automatically generates these programs for prime length FFTs. This code generating program requires information only about a set of modules for computing cyclotomic convolutions.