Pages that link to "Item:Q4151723"
From MaRDI portal
The following pages link to On Computing the Discrete Fourier Transform (Q4151723):
Displaying 42 items.
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform (Q761787) (← links)
- Parallel multiplication and powering of polynomials (Q808710) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- Self-sorting mixed-radix fast Fourier transforms (Q1050756) (← links)
- A note on prime factor FFT algorithms (Q1050757) (← links)
- Winograd's Fourier transform via circulants (Q1052079) (← links)
- Ring structure and the Fourier transform (Q1059676) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion (Q1074335) (← links)
- Implementation of a self-sorting in-place prime factor FFT algorithm (Q1087005) (← links)
- A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677) (← links)
- A new set of minimum-add small-n rotated DFT modules (Q1098609) (← links)
- 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\) (Q1110328) (← links)
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP (Q1115562) (← links)
- Index transforms for multidimensional DFT's and convolutions (Q1119008) (← links)
- Fast Fourier transformation based on number theoretic transforms (Q1123580) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- A floating-point residue arithmetic unit (Q1149769) (← links)
- Matrix identities of the fast Fourier transform (Q1153410) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- A simple derivation of Glassman's general N fast Fourier transform (Q1173394) (← links)
- Discrete convolution with modulo operations (Q1180314) (← links)
- On the multiplicative complexity of the discrete Fourier transform (Q1259162) (← links)
- In-place self-sorting fast Fourier transform algorithm with local memory references (Q1299629) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- Matrix displacement decompositions and applications to Toeplitz linear systems (Q1375094) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (Q1823640) (← links)
- Nesting strategies for prime factor FFT algorithms (Q1825020) (← links)
- Matrix decompositions using displacement rank and classes of commutative matrix algebras (Q1902113) (← links)
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806) (← links)
- Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- Efficient Computation of the Fourier Transform on Finite Groups (Q3493168) (← links)
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation (Q4274400) (← links)
- Group Convolutions and Matrix Transforms (Q4721954) (← links)
- A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM (Q5041825) (← links)
- The differential Fourier transform method (Q5269166) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers (Q5965414) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
