Recent progress and applications in group FFTs

  title={Recent progress and applications in group FFTs},
  author={Daniel N. Rockmore},
  journal={Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.},
  pages={773-777 vol.1}
  • D. Rockmore
  • Published 3 November 2002
  • Mathematics
  • Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.
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. 
Decimation-in-Frequency Fast Fourier Transforms for the Symmetric Group
In this thesis, we present a new class of algorithms that determine fast Fourier transforms for a given finite group G. These algorithms use eigenspace projections determined by a chain of subgroups
A Fast Fourier Transform for the Symmetric Group
A discrete Fourier transform, or DFT, is an isomorphism from a group algebra to a direct sum of matrix algebras. An algorithm that efficiently applies a DFT is called a fast Fourier transform, or
Fast Fourier transforms for the rook monoid
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or
Fast Fourier transforms for inverse semigroups
We define the notion of an inverse semigroup S and the notion of the Fourier transform on S. We exhibit a method for constructing Fast Fourier transforms for finite inverse semigroups. Our
A Decimation-in-Frequency Fast-Fourier Transform for the Symmetric Group
This research pertains to a particular type of FFT called Decimation in Frequency (DIF), which has a promising DIF algorithm for CSn called Orrison-DIF (ODIF).
Fast Generalized DFTs for all Finite Groups
  • C. Umans
  • Mathematics
    2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
An arithmetic algorithm is given to compute generalized Discrete Fourier Transforms with respect to G, using O(|G|^ω/2+ε) operations, for any ε > 0, where ω is the exponent of matrix multiplication.
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup
Fourier Method for Solving Two-Sided Convolution Equations on Finite Noncommutative Groups
The Fourier method on commutative groups is used in many fields of mathematics, physics, and engineering. Nowadays, this method finds increasingly wide application to non-commutative groups. Along
Proposal : Decimation-inFrequency Fast Fourier Transforms for the Symmetric Group
In recent years, researchers have begun to approach Fourier transforms from a more algebraic perspective. For example, the classical Discrete Fourier Transform (DFT) takes n evenly spaced samples of


Generalized FFTS - A Survey of Some Recent Results
This paper surveys some recent work directed towards generalizing the fast Fourier transform (FFT) from the point of view of group representation theory, and discusses generalizations of the FFT to arbitrary finite groups and compact Lie groups.
Efficient computation of Fourier transforms on compact groups
This article genralizes the fast Fourier transform algorithm to the computation of Fourier transforms on compact Lie groups. The basic technique uses factorization of group elements and
Double coset decompositions and computational harmonic analysis on groups
The decomposition of a group into double cosets and a graph theoretic indexing scheme are used to derive algorithms that generalize the Cooley-Tukey FFT to arbitrary finite group and obtain new efficient algorithms for harmonic analysis on these classes of groups.
The Cooley--Tukey FFT and Group Theory
In this paper, some of the recent work on he “separation of variables” approach to computing a Fourier transform on an arbitrary finite group is surveyed, a natural generalization of the Cooley–Tukey algorithm.
The efficient computation of Fourier transforms on the symmetric group
This paper replaces the matrix multiplications in Clausen's algorithm with sums indexed by combinatorial objects that generalize Young tableaux, and writes the result in a form similar to Horner's rule.
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II
Improved upper bounds are given for computing the Fourier transform for the general linear groups over finite fields, the classical Weyl groups, and homogeneous spaces of finite groups, while also recovering the best known algorithms for the symmetric group.
Algorithms for Fast Convolutions on Motion Groups
Abstract In this paper we apply techniques from noncommutative harmonic analysis to the development of fast algorithms for the computation of convolution integrals on motion groups. In particular, we
Sampling of Functions and Sections for Compact Groups
In this paper we investigate quadrature rules for functions on compact Lie groups and sections of homogeneous vector bundles associated with these groups. First a general notion of band-limitedness
Discrete Fourier transforms when the number of data samples is prime
  • C. Rader
  • Mathematics, Computer Science
  • 1968
The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation, which permits the discrete Fouriers transform to be computed by means of a fast Fouriertransform algorithm, with the associated increase in speed, even though N is prime.
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this