DocumentCode
394038
Title
Recent progress and applications in group FFTs
Author
Rockmore, Daniel N.
Author_Institution
Dept. of Math. & Comput. Sci., Dartmouth Coll., Hanover, NH, USA
Volume
1
fYear
2002
fDate
3-6 Nov. 2002
Firstpage
773
Abstract
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.
Keywords
fast Fourier transforms; group theory; signal processing; Cooley-Tukey FFT; DFT; compact group; discrete Fourier transform; fast Fourier transform; finite cyclic groups; group FFT; noncommutative generalizations; noncompact group; Application software; Convolution; Discrete Fourier transforms; Flexible printed circuits; Gaussian processes; History; Interpolation; Mathematics; Signal processing algorithms; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on
Conference_Location
Pacific Grove, CA, USA
ISSN
1058-6393
Print_ISBN
0-7803-7576-9
Type
conf
DOI
10.1109/ACSSC.2002.1197284
Filename
1197284
Link To Document