BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR96-282
ENTRY:: January 28, 2008
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Some Applications of Generalized FFTs
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Rockmore, Daniel N.
DATE:: July 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:: PDF at http://www.cs.dartmouth.edu/reports/TR96-282.pdf
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.
END:: ncstrl.dartmouthcs//TR96-282