Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
From MaRDI portal
We review briefly computational methods for discrete Fourier transforms (DFT) and present new techniques which are especially efficient for 2- and 3-dimensional DFT implemented on a Cray X-MP. Comparative timings are given.
Recommendations
Cites work
- A Fast Fourier Transform Algorithm Using Base 8 Iterations
- A note on prime factor FFT algorithms
- A prime factor FFT algorithm using high-speed convolution
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Fast Fourier Methods in Computational Complex Analysis
- Fast mixed-radix real Fourier transforms
- FFT algorithms for vector computers
- scientific article; zbMATH DE number 3947591 (Why is no real title available?)
- scientific article; zbMATH DE number 3705873 (Why is no real title available?)
- scientific article; zbMATH DE number 3584892 (Why is no real title available?)
- New algorithms for the multidimensional discrete Fourier transform
- On Computing the Discrete Fourier Transform
- Self-sorting mixed-radix fast Fourier transforms
Cited in
(5)- Rotating a three-dimensional array in an optimal position for vector processing: Case study for a three-dimensional fast Fourier transform
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
- A high-performance fast Fourier transform algorithm for the Cray-2
- A vector-efficient and memory-saving interpolation algorithm for PIC codes on a Cray X-MP
- Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
This page was built for publication: Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115562)