Some Applications of Generalized FFTs

Dartmouth Technical Report PCS-TR96-282

	Daniel N. Rockmore

Date: July 1996

URL (PDF): <http://www.cs.dartmouth.edu/reports/TR96-282.pdf> (1736KB)

Abstract:
 Generalized FFTs are efficient algorithms for computing a Fourier transform of a function defined on finite group, or a bandlimited function defined on a compact group.  The development of such algorithms has been accompanied and motivated by a growing number of both potential and realized applications.  This paper will attempt to survey some of these applications.  Appendices include some more detailed examples.