Multidimensional Cooley-Tukey algorithms revisited

Advances in Applied Mathematics

Volumn 17, Issue 4, 1996, Pages 477-519

  Auslander, L ^a   Johnson, J R ^b   Johnson, R W ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b DREXEL UNIVERSITY   (United States)

^c ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030527049     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1996.0019     Document Type: Article

References (13)

1. 1. L. Auslander, J. R. Johnson, and R. W. Johnson, Computing finite Fourier transforms exploiting group symmetries. I. The Role of inner products, preprint, 1993.
2. 2. L. Auslander, J. R. Johnson, and R. W. Johnson, Computing finite Fourier transforms exploiting group symmetries. II. Orbital Evaluation, preprint, 1993.
3. 3. D. H. Bailey, FFT's in external or hierarchical memory, J. Supercomp. 4 (1990), 23-35.
4. 4. T. Beth, "Vehrfahren der Schneller Fourier Transform," Teubner, Stuttgart, 1984.
5. 5. M. Clausen, Fast Fourier transforms for metabelian groups, SIAM J. Comput. 18 No. 3 (1989), 584-593.
6. 6. M. Clausen and U. Baum, "Fast Fourier Transforms," Wissshaftsverlag, Manheim, 1993.
7. 7. P. Diaconis and D. Rockmore. Efficient computation of the Fourier transform on finite groups. J. Amer. Math. Soc., 3(2):297-332, April 1990.
8. 8. J. R. Johnson, R. W. Johnson, D. Rodriguez, and R. Tolimieri. A methodology for designing, modifying, and implementing Fourier Transform algorithms on various architectures. Circuits Systems Signal Process., 9(4):449-500, 1990.
9. 9. R. W. Johnson, C.-H. Huang, and J. R. Johnson. Multilinear algebra and parallel programming. J. Supercomput. 5:189-217, 1991.
10. 10. S. D. Kaushik, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan, Efficient transposition algorithms for large matrices, In "Proceedings of Supercomputing '93, Portland, OR, Nov. 21-23, 1993," p. 656-665.
11. 11. D. Masler and D. Rockmore. Adapted diameters and the efficient computation of Fourier transforms on finite groups, preprint, 1994.
12. 12. D. Rockmore. Efficient computation of Fourier inversion for finite groups. J. Assoc. Comput. Mach. 41(1):31-66, January 1994.
13. 13. D. Rockmore, Fast Fourier analysis for abelian group extensions. Adv. Appl. Math., 11:164-204, 1990.