Self-Sorting In-Place Fast Fourier Transforms

DOI10.1137/0912043zbMATH Open0727.65125DBLPjournals/siamsc/Temperton91OpenAlexW2010918451WikidataQ56235044 ScholiaQ56235044MaRDI QIDQ3349941FDOQ3349941

Clive Temperton

Publication date: 1991

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0912043

Recommendations

• 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 self-sorting in-place prime factor FFT algorithm
• A self-sorting in-place prime factor real/half-complex FFT algorithm
• Hardware efficient fast computation of the discrete Fourier transform
• A PARALLEL FAST FOURIER TRANSFORM
• scientific article; zbMATH DE number 610966

zbMATH Keywords

algorithmsfast Fourier transformvector computersCray X-MPmultiple transformsself-sortingin-placemixed radix FFT

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (8)

• 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
• Calculation scheme based on a weighted primitive: application to image processing transforms
• Further Symmetries of in-Place FFTs
• FFT algorithms and their adaptation to parallel processing
• Implementation of a self-sorting in-place prime factor FFT algorithm

This page was built for publication: Self-Sorting In-Place Fast Fourier Transforms

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