Title:        fft
Version:      1
Submitted:    Mar 13 1989
Author:       Peter Valkenburg <cs.vu.nl!valke>
Submittor:    Peter Valkenburg <cs.vu.nl!valke>
Description:  General Fast Foufier Transform package

The packages included below perform fast fourier transformations on an
arbitrary number of real or complex samples.  It uses a generalized version
of the well-known Cooley-Tukey algorithm, meaning that it will also work
for a number of samples that is not a power of 2.

Since I didn't bother to squeeze out the very last machine cycle, you are
not advised to use this in real-time applications.  However, the recursive
algorithm used is very neat.

Enjoy.

                        Peter Valkenburg (valke@cs.vu.nl).