Four easy ways to a faster FFT

DOI10.1023/A:1020590506372MaRDI QIDQ1868495zbMATH OpenOpenAlexFDO

Authors Lenore R. Mullin, Sharon G. Small

Publication date 27 April 2003

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020590506372

zbMATH Keywords

algorithmsarray algebrafast Fourier transformFFTlinear transformationsMOAperformance analysis and evaluationPsi calculusradix nshape polymorphismshapessignal and image processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
• Modified FFTs for Fused Multiply-Add Architectures
• Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
• scientific article; zbMATH DE number 53687
• An optimized mass storage FFT for vector computers

Cited in

(9)

• An FFT performance model for optimizing general-purpose processor architecture
• High performance implementation of the TFT
• scientific article; zbMATH DE number 3921945 (Why is no real title available?)
• FAST: FFT ASIC automated synthesis
• MULTIPLY-ADD OPTIMIZED FFT KERNELS
• A highly efficient FFT using shared-memory multiplexing
• A polymorphic radix-n framework for fast Fourier transforms
• Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers

Describes a project that uses

Uses Software

• Blitz++ library

This page was built for publication: Four easy ways to a faster FFT

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