The Community for Technology Leaders
Green Image
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.
Abstract harmonic analysis, digital filtering, fast Fourier transform, Fourier analysis, time series processing.

T. Cairns, "On the Fast Fourier Transform on Finite Abelian Groups," in IEEE Transactions on Computers, vol. 20, no. , pp. 569-571, 1971.
81 ms
(Ver 3.3 (11022016))