On the Fast Fourier Transform on Finite Abelian Groups

Authors:
T. W. Cairns
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 2
Cited 4

Computation of the Fast Walsh-Fourier Transform

IEEE Transactions on Computers
A Generalized Technique for Spectral Analysis

IEEE Transactions on Computers

Generating symmetric DFTs and equivariant FFT algorithms

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A Parallel Radix-4 Fast Fourier Transform Computer

IEEE Transactions on Computers
Computing Robust Walsh-Fourier Transform by Error Product Minimization

IEEE Transactions on Computers
On the Twiddling Factors

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

Recent work, apparently beginning with a paper by Welch in 1966, has shown that character expansions on finite Abelian groups can be fast computed in a way that makes the FFT and FWT special cases. It is shown here how the computational saving depends on the annihilator subgroup of the character group under consideration.