## Generalized FFTs -- A Survey Of Some Recent Results (1995)

### Cached

### Download Links

- [www.math.dartmouth.edu]
- [ftp.cs.dartmouth.edu]
- DBLP

### Other Repositories/Bibliography

by
David K. Maslen
,
Daniel N. Rockmore

Citations: | 50 - 7 self |

### BibTeX

@MISC{Maslen95generalizedffts,

author = {David K. Maslen and Daniel N. Rockmore},

title = {Generalized FFTs -- A Survey Of Some Recent Results},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### 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.