Article thumbnail

Automatic Generation of Prime Length FFT Programs

By Ivan W. Selesnick and C. Sidney BurrusIvan W. Selesnick and C. Sidney Burrus

Abstract

Journal PaperWe 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

Topics: fft algorithms, FFTs, fft algorithms
Year: 2004
DOI identifier: 10.1109/78.482008
OAI identifier: oai:scholarship.rice.edu:1911/20351
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/1911/203... (external link)
  • http://www.dsp.rice.edu/softwa... (external link)
  • http://dsp.rice.edu/) (external link)
  • http://dx.doi.org/10.1109/78.4... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles