Recent progress and applications in group FFTs (2003)
by
Daniel N. Rockmore
| Venue: | NATO Advanced Study Institute on Computational Noncommutative Algebra and Applications |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Rockmore03recentprogress,
author = {Daniel N. Rockmore},
title = {Recent progress and applications in group FFTs},
booktitle = {NATO Advanced Study Institute on Computational Noncommutative Algebra and Applications},
year = {2003}
}
OpenURL
Abstract
The Cooley-Tukey FFT can be interpreted as an algorithm for the efficient computation of the Fourier transform for finite cyclic groups, a compact group (the circle), or the non-compact group of the real line. These are all commutative instances of a “Group FFT”. We give a brief survey of some recent progress made in the direction of noncommutative generalizations and their applications.







