Computing the Fast Fourier Transform on a Vector Computer

DOI10.2307/2006072MaRDI QIDQ4194404zbMATH OpenOpenAlexFDO

Authors David Korn, Jules J. Jun. Lambiotte

Publication date 1979

Full work available at URL https://doi.org/10.2307/2006072

zbMATH Keywords

AlgorithmsFast Fourier TransformVector Computer

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites work

• A Fast Fourier Transform Algorithm Using Base 8 Iterations
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer

Cited in

(8)

• Self-sorting mixed-radix fast Fourier transforms
• Fast mixed-radix real Fourier transforms
• Diamond - A sorting method for vector machines
• Parallel vector multidimensional Slant, Haar, and Walsh-Hadamard transforms
• On vectorizing the fast fourier transform
• A Vector Implementation of the Fast Fourier Transform Algorithm
• Generating formally verified quantum Fourier transform algorithms
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

This page was built for publication: Computing the Fast Fourier Transform on a Vector Computer

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