A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
DOI10.1007/BF01189337zbMATH Open0716.65131OpenAlexW2045810654MaRDI QIDQ753467FDOQ753467
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
Recommendations
tensor productsfast Fourier transformsCooley-Tukey algorithmCRAY X-MP's architecturespecific architecture
Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Parallel Processing with the Perfect Shuffle
- Access and Alignment of Data in an Array Processor
- FFT algorithms for vector computers
- Self-sorting mixed-radix fast Fourier transforms
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Multiprocessor FFTs
- Implementation of a self-sorting in-place prime factor FFT algorithm
- A note on prime factor FFT algorithms
- Implementation of a prime factor FFT algorithm on CRAY-1
- Computing the Fast Fourier Transform on a Vector Computer
Cited In (16)
- A report on the performance of an implementation of Strassen's algorithm
- The ubiquitous Kronecker product
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- Title not available (Why is that?)
- Parametric versions of the fast Fourier transform
- On the properties of a new tensor product of matrices
- Automatic derivation and implementation of fast convolution algorithms
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
- A methodology towards automatic implementation of \(N\)-body algorithms
- Multilinear algebra and parallel programming
- Generalization of the fast Fourier transform with a constant structure
- A tensor product formulation of Strassen's matrix multiplication algorithm
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
- Title not available (Why is that?)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
- New Good's type Kronecker power expansions
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)
