Computing the Fast Fourier Transform on a Vector Computer

DOI10.2307/2006072zbMath0407.65059OpenAlexW4242876358MaRDI QIDQ4194404

Jules J. Jun. Lambiotte, David Korn

Publication date: 1979

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

zbMATH Keywords

AlgorithmsFast Fourier TransformVector Computer

Mathematics Subject Classification ID

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

Related Items (7)

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

Cites Work

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

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