<< Chapter < Page Chapter >> Page >

This book has developed a class of efficient algorithms based on index mapping and polynomial algebra. This provides aframework from which the Cooley-Tukey FFT, the split-radix FFT, the PFA, and WFTA can be derived. Even the programs implementing thesealgorithms can have a similar structure. Winograd's theorems were presented and shown to be very powerful in both deriving algorithmsand in evaluating them. The simple radix-2 FFT provides a compact, elegant means for efficiently calculating the DFT. If someelaboration is allowed, significant improvement can be had from the split-radix FFT, the radix-4 FFT or the PFA. If multiplications areexpensive, the WFTA requires the least of all.

Several method for transforming real data were described that are more efficient than directly using a complex FFT. Acomplex FFT can be used for real data by artificially creating a complex input from two sections of real input. An alternative andslightly more efficient method is to construct a special FFT that utilizes the symmetries at each stage.

As computers move to multiprocessors and multicore, writing and maintaining efficient programs becomes more and more difficult.The highly structured form of FFTs allows automatic generation of very efficient programs that are tailored specifically to aparticular DSP or computer architecture.

For high-speed convolution, the traditional use of the FFT or PFA with blocking is probably the fastest method although rectangular transforms,distributed arithmetic, or number theoretic transforms may have a future with special VLSI hardware.

The ideas presented in these notes can also be applied to the calculation of the discrete Hartley transform [link] , [link] , the discrete cosine transform [link] , [link] , and to number theoretic transforms [link] , [link] , [link] .

There are many areas for future research. The relationship of hardware to algorithms, the proper use of multiple processors,the proper design and use of array processors and vector processors are all open. There are still many unanswered questions inmulti-dimensional algorithms where a simple extension of one-dimensional methods will not suffice.

Get the best College algebra course in your pocket!

Source:  OpenStax, Fast fourier transforms. OpenStax CNX. Nov 18, 2012 Download for free at http://cnx.org/content/col10550/1.22
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Fast fourier transforms' conversation and receive update notifications?