A Modified Split-Radix FFT With Fewer Arithmetic Operations
From MaRDI portal
Publication:4564286
DOI10.1109/TSP.2006.882087zbMATH Open1390.65168DBLPjournals/tsp/JohnsonF07WikidataQ54087132 ScholiaQ54087132MaRDI QIDQ4564286FDOQ4564286
Steven G. Johnson, Matteo Frigo
Publication date: 12 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Cited In (29)
- The Tangent FFT
- Improvement of the discrete cosine transform calculation by means of a recursive method
- Resource scheduling with variable requirements over time
- Title not available (Why is that?)
- Five-step FFT algorithm with reduced computational complexity
- The fast Fourier transform and fast wavelet transform for patterns on the torus
- FFT program generation for ring LWE-based cryptography
- On the real complexity of a complex DFT
- Efficient algorithms for the discrete Gabor transform with a long FIR window
- Convergence of FFT‐based homogenization for strongly heterogeneous media
- Title not available (Why is that?)
- Efficient fixed point and Newton-Krylov solvers for FFT-based homogenization of elasticity at large deformations
- An improved FFT-based version of Ramaswami's formula
- A robust hierarchical motion estimation algorithm in noisy image sequences in the bispectrum domain
- Identification and validation of stable ARFIMA processes with application to UMTS data
- Interpolative Butterfly Factorization
- Analysis of the dissipation and dispersion properties of the multi-domain Chebyshev pseudospectral method
- A parallel fast multipole method for elliptic difference equations
- Recursive calculation of discrete cosine transform for low resolution signal processing
- Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity
- Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
- The finite element square reduced (FE2R ) method with GPU acceleration: towards three-dimensional two-scale simulations
- Multilevel Quasi-Monte Carlo methods for lognormal diffusion problems
- FFT Implementation with Fused Floating-Point Operations
- Numerical methods for accurate description of ultrashort pulses in optical fibers
- Fast Fourier transform using matrix decomposition
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Artificial boundary conditions for the Burgers equation on the plane
- Generalized discrete Fourier transform on the base of Lagrange and Hermite interpolation formulas
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)
