Implementation of a self-sorting in-place prime factor FFT algorithm

DOI10.1016/0021-9991(85)90164-0MaRDI QIDQ1087005zbMATH OpenOpenAlexFDO

Authors Clive Temperton

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0021-9991(85)90164-0

zbMATH Keywords

discrete Fourier transformFortran routineprime factor fast Fourier transform algorithm

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)

Recommendations

• A self-sorting in-place prime factor real/half-complex FFT algorithm
• Self-Sorting In-Place Fast Fourier Transforms
• A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
• In-place self-sorting fast Fourier transform algorithm with local memory references
• Implementation of a prime factor FFT algorithm on CRAY-1
• An in-order, partially in-place mixed radix FFT algorithm
• Nesting strategies for prime factor FFT algorithms
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

Cites work

• scientific article; zbMATH DE number 3140885 (Why is no real title available?)
• scientific article; zbMATH DE number 3880785 (Why is no real title available?)
• scientific article; zbMATH DE number 3967873 (Why is no real title available?)
• A note on prime factor FFT algorithms
• A prime factor FFT algorithm using high-speed convolution
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An in-place, in-order prime factor FFT algorithm
• Fast mixed-radix real Fourier transforms
• Implementation of the in-order prime factor transform for variable sizes
• Index mappings for multidimensional formulation of the DFT and convolution
• On Computing the Discrete Fourier Transform
• On the structure of efficient DFT algorithms
• Self-sorting mixed-radix fast Fourier transforms
• The Relationship Between Two Fast Fourier Transforms
• The design of optimal DFT algorithms using dynamic programming

Cited in

(15)

• A self-sorting in-place prime factor real/half-complex FFT algorithm
• In-place self-sorting fast Fourier transform algorithm with local memory references
• A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
• A new set of minimum-add small-n rotated DFT modules
• FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Nesting strategies for prime factor FFT algorithms
• FFT algorithms and their adaptation to parallel processing
• A prime factor FTT algorithm using distributed arithmetic
• A numerical study of turbulent supersonic isothermal-wall channel flow
• Automatic derivation and implementation of fast convolution algorithms
• Implementation of the in-order prime factor transform for variable sizes
• An in-order, partially in-place mixed radix FFT algorithm
• Implementation of a prime factor FFT algorithm on CRAY-1
• Self-Sorting In-Place Fast Fourier Transforms

This page was built for publication: Implementation of a self-sorting in-place prime factor FFT algorithm

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