@TechReport{Dartmouth:TR96-281,
  author = {David K. Maslen and Daniel N. Rockmore},
  title = {{Generalized FFTS - A Survey of Some Recent Results}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR96-281},
  year = {1996},
  month = {April},
  URL = {http://www.cs.dartmouth.edu/reports/TR96-281.ps.Z},
  comment = {
    This will appear as part of the Proceedings for the 1994
    Workshop in Groups and Computation, DIMACS Series of the AMS,
    edited by Larry Finkelstein and William Kantor.
  },
  abstract = {
    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 efficient algorithms for computing the
    Fourier transform of either a function defined on a finite abelian
    group, or a bandlimited function on a compact abelian group.  We
    discuss generalizations of the FFT to arbitrary finite groups and
    compact Lie groups.
  }
}