Four easy ways to a faster FFT

DOI10.1023/A:1020590506372zbMath1016.65112OpenAlexW1576794950MaRDI QIDQ1868495

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

shapesalgorithmsFFTfast Fourier transformsignal and image processinglinear transformationsperformance analysis and evaluationarray algebraMOAPsi calculusradix nshape polymorphism

Mathematics Subject Classification ID

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

Related Items (1)

Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform

Uses Software

• Blitz++ library

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