On the Fast Fourier Transform on Finite Abelian Groups
- 1 May 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (5) , 569-571
- https://doi.org/10.1109/t-c.1971.223291
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.Keywords
This publication has 6 references indexed in Scilit:
- Calculation of Fourier transforms on finite Abelian groups (Corresp.)IEEE Transactions on Information Theory, 1970
- A Generalized Technique for Spectral AnalysisIEEE Transactions on Computers, 1970
- A guided tour of the fast Fourier transformIEEE Spectrum, 1969
- Computation of the Fast Walsh-Fourier TransformIEEE Transactions on Computers, 1969
- Transformations Among Switching Function Canonical FormsIEEE Transactions on Electronic Computers, 1963
- Abstract Harmonic AnalysisPublished by Springer Nature ,1963