On Computing the Discrete Fourier Transform
From MaRDI portal
Cites work
- Algebras Having Linear Multiplicative Complexities
- An Algorithm for the Machine Calculation of Complex Fourier Series
- scientific article; zbMATH DE number 3140885 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- Some bilinear forms whose multiplicative complexity depends on the field of constants
Cited in
(44)- Self-sorting mixed-radix fast Fourier transforms
- A note on prime factor FFT algorithms
- Winograd's Fourier transform via circulants
- Ring structure and the Fourier transform
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion
- Implementation of a self-sorting in-place prime factor FFT algorithm
- A self-sorting in-place prime factor real/half-complex FFT algorithm
- A new set of minimum-add small-n rotated DFT modules
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\)
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- Index transforms for multidimensional DFT's and convolutions
- Fast Fourier transformation based on number theoretic transforms
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- A floating-point residue arithmetic unit
- Matrix identities of the fast Fourier transform
- Size bounds for superconcentrators
- A simple derivation of Glassman's general N fast Fourier transform
- Discrete convolution with modulo operations
- On the multiplicative complexity of the discrete Fourier transform
- In-place self-sorting fast Fourier transform algorithm with local memory references
- On algebras related to the discrete cosine transform
- Matrix displacement decompositions and applications to Toeplitz linear systems
- The multiplicative complexity of discrete cosine transforms
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations
- Nesting strategies for prime factor FFT algorithms
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions
- Vector coding algorithms for multidimensional discrete Fourier transform
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Efficient Computation of the Fourier Transform on Finite Groups
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Group Convolutions and Matrix Transforms
- A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM
- The differential Fourier transform method
- Fast convolutions meet Montgomery
- Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers
- Fast norm computation in smooth-degree abelian number fields
- Scalable Methods for Multiple Time Series Comparison in Second Order Dynamics
- A survey of polynomial multiplications for lattice-based cryptosystems
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
- Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform
- Parallel multiplication and powering of polynomials
- On arithmetical algorithms over finite fields
This page was built for publication: On Computing the Discrete Fourier Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151723)
