|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Fast Fourier Transform on Finite Abelian Groups
May 1971 (vol. 20 no. 5)
pp. 569-571
| ASCII Text | x | ||
| T.W. Cairns, "On the Fast Fourier Transform on Finite Abelian Groups," IEEE Transactions on Computers, vol. 20, no. 5, pp. 569-571, May, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223291, author = {T.W. Cairns}, title = {On the Fast Fourier Transform on Finite Abelian Groups}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {5}, issn = {0018-9340}, year = {1971}, pages = {569-571}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223291}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Fast Fourier Transform on Finite Abelian Groups IS - 5 SN - 0018-9340 SP569 EP571 EPD - 569-571 A1 - T.W. Cairns, PY - 1971 KW - Abstract harmonic analysis KW - digital filtering KW - fast Fourier transform KW - Fourier analysis KW - time series processing. VL - 20 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
Abstract harmonic analysis, digital filtering, fast Fourier transform, Fourier analysis, time series processing.
Citation:
T.W. Cairns, "On the Fast Fourier Transform on Finite Abelian Groups," IEEE Transactions on Computers, vol. 20, no. 5, pp. 569-571, May 1971, doi:10.1109/T-C.1971.223291
Usage of this product signifies your acceptance of the Terms of Use.