scientific article

zbMath0536.65098MaRDI QIDQ3321411

Thomas Beth

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

FFTfast algorithmsfast Fourier transformdiscrete Fourier transformcomputer algebraDFTmultiplicative complexitymatrix transposedigital convolutionButterfly operationmethod of pipelinewindow effect

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signal detection and filtering (aspects of stochastic processes) (60G35) Trigonometric interpolation (42A15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Communication theory (94A05)

Related Items

Applications of the DFT to Abelian difference sets, On the computational complexity of the general discrete Fourier transform, Testing the shift-equivalence of polynomials using quantum machines, Symmetry-based matrix factorization, Fast generalized Fourier transforms, Extensions of irreducible representations, Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines., Computing generalized convolutions faster than brute force, Fast Fourier analysis for abelian group extensions, Representation-theoretical properties of the approximate quantum Fourier transform, Existence and efficient construction of fast Fourier transforms on supersolvable groups, The efficient computation of Fourier transforms on the symmetric group, Generalization of the algebraic discrete Fourier transform with application to fast convolutions, The \(GF(p)\)-dimension of the codes generated by the classical point-line geometries over \(GF(p)\), Efficient Computation of the Fourier Transform on Finite Groups, Generalizing the discrete Fourier transform, Improved upper complexity bounds for the discrete Fourier transform, Decomposing monomial representations of solvable groups.