Five-step FFT algorithm with reduced computational complexity
type: Item
instance of: scholarly article
title: Five-step FFT algorithm with reduced computational complexity
zbMATH Open document ID: 1184.68267
author: Rami Al Na'mneh
author: W. David Pan
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5664769
zbMATH Keywords: five-step fast Fourier transform
zbMATH Keywords: computational complexity
describes a project that uses: FFTW
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.10.009
OpenAlex ID: W1984254719
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Fast Fourier transforms: A tutorial review and a state of the art
cites work: Numerical recipes in C++. The art of scientific computing
cites work: Multiprocessor FFTs
cites work: A comparison of optimal FFTs on torus and hypercube multicomputers
cites work: A parallel 1-D FFT algorithm for the Hitachi SR8000
DOI: 10.1016/J.IPL.2006.10.009
Recommended article: Q3713553
Recommended article: Simple FFT and DCT algorithms with reduced number of operations.
Recommended article: A Modified Split-Radix FFT With Fewer Arithmetic Operations
Recommended article: Q3761658
Recommended article: An efficient FFT algorithm based on the discrete sine transform
Recommended article: Q3490922
Recommended article: Q3804141
Recommended article: Lesser known FFT algorithms
Recommended article: On a fast algorithm for computing the Fourier transform
description: scientific article; zbMATH DE number 5664769