On the Fast Fourier Transform on Finite Abelian Groups

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.