A Modified Split-Radix FFT With Fewer Arithmetic Operations

DOI10.1109/TSP.2006.882087zbMATH Open1390.65168DBLPjournals/tsp/JohnsonF07WikidataQ54087132 ScholiaQ54087132MaRDI QIDQ4564286FDOQ4564286

Authors Steven G. Johnson, Matteo Frigo

Publication date 12 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited in

(29)

• Generalized discrete Fourier transform on the base of Lagrange and Hermite interpolation formulas
• Recursive calculation of discrete cosine transform for low resolution signal processing
• A robust hierarchical motion estimation algorithm in noisy image sequences in the bispectrum domain
• The finite element square reduced (\(FE^{2R}\)) method with GPU acceleration: towards three-dimensional two-scale simulations
• Multiplication
• Efficient algorithms for the discrete Gabor transform with a long FIR window
• Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity
• The fast Fourier transform and fast wavelet transform for patterns on the torus
• Interpolative butterfly factorization
• Numerical methods for accurate description of ultrashort pulses in optical fibers
• Analysis of the dissipation and dispersion properties of the multi-domain Chebyshev pseudospectral method
• Multilevel Quasi-Monte Carlo methods for lognormal diffusion problems
• A parallel fast multipole method for elliptic difference equations
• FFT Implementation with Fused Floating-Point Operations
• An improved FFT-based version of Ramaswami's formula
• Efficient fixed point and Newton-Krylov solvers for FFT-based homogenization of elasticity at large deformations
• Separation of variables and the computation of Fourier transforms on finite groups. II
• The Tangent FFT
• Improvement of the discrete cosine transform calculation by means of a recursive method
• Identification and validation of stable ARFIMA processes with application to UMTS data
• Five-step FFT algorithm with reduced computational complexity
• FFT program generation for ring LWE-based cryptography
• Convergence of FFT-based homogenization for strongly heterogeneous media
• Fast Fourier transform using matrix decomposition
• On the real complexity of a complex DFT
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Resource scheduling with variable requirements over time
• Artificial boundary conditions for the Burgers equation on the plane
• Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms

This page was built for publication: A Modified Split-Radix FFT With Fewer Arithmetic Operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564286)