language: en

[DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 19xx]

Some applications of generalized FFTs

Daniel N. Rockmore

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.

1. A brief history