Five-step FFT algorithm with reduced computational complexity

Authors:
Rami Al Na'mneh;W. David Pan
Affiliations:
Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, AL 35899, USA;Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, AL 35899, USA
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 0

Performance analysis of the FFT algorithm on a shared-memory parallel architecture

IBM Journal of Research and Development
Fast fourier transforms: a tutorial review and a state of the art

Signal Processing
FFTs in external or hierarchical memory

The Journal of Supercomputing
Index Mapping Approach of Deriving the PM DFT Algorithms

IEEE Transactions on Computers
A fast Fourier transform compiler

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A comparison of optimal FFTs on torus and hypercube multicomputers

Parallel Computing
Digital Signal Processing: A Computer-Based Approach

Digital Signal Processing: A Computer-Based Approach
The Fastest Fourier Transform in the West

The Fastest Fourier Transform in the West
A parallel 1-D FFT algorithm for the Hitachi SR8000

Parallel Computing
A new technique for twiddle-factor elimination in multidimensionalFFT's

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We propose a fast Fourier transform algorithm, which removes two steps of twiddle factor multiplications from the conventional five-step FFT algorithm. The proposed FFT algorithm not only reduces the computational complexity of the five-step FFT algorithm by O(n) operations, but also reduces its memory requirement.