scientific article; zbMATH DE number 847093

MaRDI QIDQ4864906zbMATH OpenFDO

Authors

Publication date 25 February 1996

zbMATH Keywords

algorithmgeneralized discrete Fourier transformmultiplicative complexity

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• The multiplicative complexity of the discrete Fourier transform
• On the computational complexity of the general discrete Fourier transform
• scientific article; zbMATH DE number 4037044
• scientific article; zbMATH DE number 193953
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• The multiplicative complexity of discrete cosine transforms
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• On the multiplicative complexity of discrete cosine transforms
• An efficient algorithm for the computation of the multidimensional discrete Fourier transform
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

Cited in

(5)

• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• A Generalized Prime Factor FFT Algorithm for any N = 2p 3q 5r
• On the multiplicative complexity of discrete cosine transforms
• scientific article; zbMATH DE number 193953 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864906)