The FFT: An Algorithm the Whole Family Can Use

Authors:
Daniel N. Rockmore
Affiliations:
-
Venue:
Computing in Science and Engineering
Year:
2000

Citing 5
Cited 1

The fast Fourier transform and its applications

The fast Fourier transform and its applications
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
Fast Fourier transforms for nonequispaced data

SIAM Journal on Scientific Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Performing out-of-core FFTs on parallel disk systems

Parallel Computing - Special issues on applications: parallel data servers and applications

The Fast Fourier Transform for Experimentalists, Part I: Concepts

Computing in Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fast Fourier transform is one of the fundamental algorithm families in digital information processing. The author discusses its past, present, and future, along with its important role in our current digital revolution.