ISSN:
1531-5878
Source:
Springer Online Journal Archives 1860-2000
Topics:
Electrical Engineering, Measurement and Control Technology
Notes:
Abstract Fourier transform algorithms are described using tensor (Kronecker) products and an associated class of permutations. Algebraic properties of tensor products and the related permutations are used to derive variants of the Cooley-Tukey fast Fourier transform algorithm. These algorithms can be implemented by translating tensor products and permutations to programming constructs. An implementation can be matched to a specific computer architecture by selecting the appropriate variant. This methodology is carried out for the Cray X-MP and the AT&T DSP32.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01189337
Permalink