• DOI:10.1007/1-4020-2307-3_9
Corpus ID: 1412268

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}
}

D.N. Rockmore

Published 2002

Mathematics

Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.

View on IEEE

prometheus-inc.com

Save to Library

Create Alert

Cite

Launch Research Feed

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.