Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
DOI10.1109/29.60070zbMATH Open0703.65097DBLPjournals/tsp/Duhamel90OpenAlexW2125775646WikidataQ54087154 ScholiaQ54087154MaRDI QIDQ3482811FDOQ3482811
Authors: Pierre Duhamel 
Publication date: 1990
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/29.60070
Recommendations
- Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
- scientific article
- The multiplicative complexity of the discrete Fourier transform
- scientific article; zbMATH DE number 847093
- A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">$N=q\times 2^{m}$</tex></formula> DFTs
- Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field
- On the multiplicative complexity of discrete cosine transforms
- The multiplicative complexity of discrete cosine transforms
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- On the computational complexity of the general discrete Fourier transform
discrete Fourier transformmultiplicative complexityminimum number of complex multiplicationssplit-radix decompositionssplit-radix DFT- algorithms
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Cited In (4)
This page was built for publication: Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3482811)
