This directory contains the QFT ("Quick Discrete Fourier Transform")
implementation by Gary A. Sitton.

[H. Guo, G. A. Sitton, C. S. Burrus, "The Quick Discrete Fourier Transform," 
Proc. ICASSP, April 1994.]

H. Guo: harry@ece.rice.edu
G. A. Sitton: ?
C. S. Burrus: csb@rice.edu

http://www-ece.rice.edu/~harry/qft.html

------------------------------------------------------------------------

This program was adapted for use with benchfft by Steven G. Johnson,
10/97.  I changed float to FFTW_REAL and long to int, and
reverse-engineered hard-coded constants to add extra digits (in order
to take advantage of double precision when FFTW_REAL == double).  I
also modified qftinit to take the work-space array as a parameter,
since benchfft already has allocated a work array.

The original package also contained a standard radix-2 complex-complex
routine, as well as a split-radix real-complex routine.  There were
test programs, too.  These are not included in the benchfft
distribution; if you want them, you can download them from the above
URL.
