Proceedings for the 1994 Workshop in Groups and Computation
Department of Computer Science
In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting the classical FFT can be viewed as a family of efficient algorithms for computing the Fourier transform of either a function defined on a finite abelian group, or a bandlimited function on a compact abelian group. We discuss generalizations of the FFT to arbitrary finite groups and compact Lie groups.
Maslen, D.K., & Rockmore, D.N. (1994). Generalized FFTS - A Survey of Some Recent Results. Proceedings for the 1994 Workshop in Groups and Computation, DIMACS Series of the AMS.
Dartmouth Digital Commons Citation
Maslen, David K. and Rockmore, Daniel N., "Generalized FFTS - A Survey of Some Recent Results" (1994). Dartmouth Scholarship. 4040.