Recent progress and applications in group FFTs
Daniel N. Rockmore · 2003
The Cooley-Tukey FFT can be interpreted as an algorithm for the efficient computation of the Fourier transform for the finite cyclic groups, a compact group, or the non-compact group of the real line. All of which are commutative instances of a "Group FFT". A brief survey of some recent progress made in the direction of noncommutative generalizations and applications is given.