A note on prime factor FFT algorithms

DOI10.1016/0021-9991(83)90024-4MaRDI QIDQ1050757zbMATH OpenOpenAlexFDO

Authors Clive Temperton

Publication date 1983

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9991(83)90024-4

zbMATH Keywords

fast Fourier transformdiscrete Fourier transformsvector machinesprime factor algorithmslarge-scale scientific computers

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cites work

• scientific article; zbMATH DE number 3140885 (Why is no real title available?)
• scientific article; zbMATH DE number 3705872 (Why is no real title available?)
• scientific article; zbMATH DE number 3338193 (Why is no real title available?)
• A Fast Fourier Transform Algorithm Using Base 8 Iterations
• A prescription of winograd's discrete Fourier transform algorithm
• A prime factor FFT algorithm using high-speed convolution
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An introduction to programming the Winograd Fourier transform algorithm (WFTA)
• Fast computation of discrete Fourier transforms using polynomial transforms
• On Computing the Discrete Fourier Transform
• Self-sorting mixed-radix fast Fourier transforms

Cited in

(7)

• A self-sorting in-place prime factor real/half-complex FFT algorithm
• A new set of minimum-add small-n rotated DFT modules
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Nesting strategies for prime factor FFT algorithms
• Implementation of a self-sorting in-place prime factor FFT algorithm
• A fully nonlinear, mixed spectral and finite difference model for thermally driven, rotating flows
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP

This page was built for publication: A note on prime factor FFT algorithms

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