BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR96-281
ENTRY:: April 15, 1996
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Generalized FFTS - A Survey of Some Recent Results
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Maslen, David K.
AUTHOR:: Rockmore, Daniel N.
DATE:: April 1996
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR96-281.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR96-281.pdf
ABSTRACT:: 
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.
NOTE:: 
This will appear as part of the Proceedings for the 1994
Workshop in Groups and Computation, DIMACS Series of the AMS,
edited by Larry Finkelstein and William Kantor.
END:: ncstrl.dartmouthcs//TR96-281