Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

DOI10.1109/29.60070zbMath0703.65097DBLPjournals/tsp/Duhamel90OpenAlexW2125775646WikidataQ54087154 ScholiaQ54087154MaRDI QIDQ3482811

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

zbMATH Keywords

discrete Fourier transform multiplicative complexity minimum number of complex multiplications split-radix decompositions split-radix DFT- algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11) Complexity and performance of numerical algorithms (65Y20)

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