Document Type
Article
Publication Date
1997
Publication Title
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Department
Department of Computer Science
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.
DOI
https://doi.org/10.1090/dimacs/028
Original Citation
Rockmore, D.N. (1997). Some Applications of Generalized FFTs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 28. doi: https://doi.org/10.1090/dimacs/028
Dartmouth Digital Commons Citation
Rockmore, Daniel N., "Some Applications of Generalized FFTs" (1997). Dartmouth Scholarship. 4039.
https://digitalcommons.dartmouth.edu/facoa/4039
Comments
Listed in the Dartmouth College Technical Report Series as PCS-TR96-282.