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