A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

DOI10.1007/BF01189337MaRDI QIDQ753467zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1990

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01189337

zbMATH Keywords

tensor productsfast Fourier transformsCooley-Tukey algorithmCRAY X-MP's architecturespecific architecture

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• scientific article; zbMATH DE number 494440
• FFT algorithms for vector computers
• scientific article; zbMATH DE number 3956396
• The techniques of the generalized fast Fourier transform algorithm

Cites work

• A note on prime factor FFT algorithms
• Access and Alignment of Data in an Array Processor
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Computing the Fast Fourier Transform on a Vector Computer
• FFT algorithms for vector computers
• Implementation of a prime factor FFT algorithm on CRAY-1
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Multiprocessor FFTs
• Parallel Processing with the Perfect Shuffle
• Self-sorting mixed-radix fast Fourier transforms

Cited in

(16)

• Multilinear algebra and parallel programming
• On the properties of a new tensor product of matrices
• A tensor product formulation of Strassen's matrix multiplication algorithm
• Generalization of the fast Fourier transform with a constant structure
• Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
• Parametric versions of the fast Fourier transform
• The ubiquitous Kronecker product
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
• FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
• New Good's type Kronecker power expansions
• scientific article; zbMATH DE number 1940301 (Why is no real title available?)
• A report on the performance of an implementation of Strassen's algorithm
• A methodology towards automatic implementation of \(N\)-body algorithms
• Automatic derivation and implementation of fast convolution algorithms
• scientific article; zbMATH DE number 3976284 (Why is no real title available?)

This page was built for publication: A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753467)