A Modified Split-Radix FFT With Fewer Arithmetic Operations

By Steven G. Johnson, Matteo Frigo. IEEE Transactions on Signal Processing, 2007

391 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Hardware and Architecture, Signal Processing

View Paper: https://www.semanticscholar.org/paper/15b1282cd9430ed5659fd4ec92c6fc2a692b0710

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Matti Schneider
2. Matthias Kabel

In Hardware and Architecture

1. Matti Schneider

In Signal Processing

1. Matti Schneider

Citations in the corpus

• TOWARD EARLY-WARNING DETECTION OF GRAVITATIONAL WAVES FROM COMPACT BINARY COALESCENCE (2011, methodology): “…block, the algorithm computes the forward FFT of the data and each of the templates, multiplies them, and then computes the reverse FFT. Modern implementations of the FFT, such as the ubiquitous fftw, require about 2D lgD operations to evaluate a real transform of size D (Johnson & Frigo 2007).”
• Convergence of FFT‐based homogenization for strongly heterogeneous media (2015, methodology): “The FFT algorithm (see for instance [23] for a fast implementation) is used to convert between real and Fourier space.”