@TechReport{Dartmouth:TR96-282,
  author = {Daniel N. Rockmore},
  title = {{Some Applications of Generalized FFTs}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR96-282},
  year = {1996},
  month = {July},
  URL = {http://www.cs.dartmouth.edu/reports/TR96-282.pdf},
  abstract = {
    Generalized FFTs are efficient algorithms for computing a Fourier transform of a function defined on finite group, or a bandlimited function defined on a compact group.  The development of such algorithms has been accompanied and motivated by a growing number of both potential and realized applications.  This paper will attempt to survey some of these applications.  Appendices include some more detailed examples.
  }
}