deposit_your_work

Automatic Generation of Prime Length FFT Programs

Files in this item

Files Size Format View
Sel1996Jan1AutomaticG.PS 90.03Kb application/postscript View/Open

Show full item record

Item Metadata

Title: Automatic Generation of Prime Length FFT Programs
Author: Selesnick, Ivan W.; Burrus, C. Sidney
Type: Journal Paper
Keywords: fft algorithms
Citation: I. W. Selesnick and C. S. Burrus, "Automatic Generation of Prime Length FFT Programs," IEEE Transactions on Signal Processing, vol. 44, no. 1, 1996.
Abstract: 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.
Date Published: 1996-01-01

This item appears in the following Collection(s)

  • ECE Publications [1034 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [508 items]
    Publications by Rice Faculty and graduate students in digital signal processing.