Recent progress and applications in group FFTs
@article{Rockmore2002RecentPA, title={Recent progress and applications in group FFTs}, author={D. N. Rockmore}, journal={Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.}, year={2002}, volume={1}, pages={773-777 vol.1} }
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.
28 Citations
Fast Generalized DFTs for all Finite Groups
- Mathematics, Computer Science
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019
- PDF
References
SHOWING 1-10 OF 70 REFERENCES
The efficient computation of Fourier transforms on the symmetric group
- Computer Science, Mathematics
- Math. Comput.
- 1998
- 49
- PDF
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II
- Mathematics
- 1997
- 39
- PDF
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups
- Mathematics, Computer Science
- AAECC
- 1999
- 52
- PDF