A note on prime factor FFT algorithms

DOI10.1016/0021-9991(83)90024-4zbMath0513.65093MaRDI QIDQ1050757

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 transform; discrete Fourier transforms; vector machines; prime factor algorithms; large-scale scientific computers

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

20D60: Arithmetic and combinatorial problems involving abstract finite groups

65T40: Numerical methods for trigonometric approximation and interpolation

Related Items

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

Cites Work

• Self-sorting mixed-radix fast Fourier transforms
• A prescription of winograd's discrete Fourier transform algorithm
• Fast computation of discrete Fourier transforms using polynomial transforms
• On Computing the Discrete Fourier Transform
• An introduction to programming the Winograd Fourier transform algorithm (WFTA)
• A prime factor FFT algorithm using high-speed convolution
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A Fast Fourier Transform Algorithm Using Base 8 Iterations
• Unnamed Item
• Unnamed Item
• Unnamed Item