Generalized FFT's- A survey of some recent results

@inproceedings{Maslen1995GeneralizedFA,
  title={Generalized FFT's- A survey of some recent results},
  author={David Keith Maslen and Daniel N. Rockmore},
  booktitle={Groups and Computation},
  year={1995}
}
In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting the classical FFT can be viewed as a family of eecient algorithms for computing the Fourier transform of either a function deened on a nite abelian group, or a bandlimited function on a compact abelian group. We discuss generalizations of the FFT to arbitrary nite groups and compact Lie groups. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
14 Citations
59 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 59 references

Discrete Fourier transforms when the number of data samples is prime

  • C. Rader
  • IEEE Proc. 56
  • 1968
Highly Influential
6 Excerpts

Computing Fourier transforms and convolutions on the 2-sphere

  • J. R. Driscoll, D. Healy
  • (extended abstract) Proc. 34th IEEE FOCS, (1989…
  • 1994
Highly Influential
20 Excerpts

Bernstein's theorem for compact

  • G. Gaudrey, R. Pini
  • connected Lie groups, Math. Proc. Cambridge Phil…
  • 1986
Highly Influential
4 Excerpts

Bernstein's Theorem on SU(2)

  • R. Pini
  • Boll. Un. Mat. Ital. A (6) 4-A
  • 1985
Highly Influential
4 Excerpts

The design and analysis of factorial experiments

  • F. Yates
  • Imp. Bur. Soil Sci. Tech. Comm. 35
  • 1937
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…