On the number of active *-operations needed to compute the discrete Fourier transform

DOI10.1007/BF00288772zbMath0411.65073MaRDI QIDQ1259425

Bernhard Mescheder

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

discrete Fourier transformcomputational efficiencynumber of operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Numerical methods for trigonometric approximation and interpolation (65T40)

Cites Work

• Unnamed Item
• On computing the Discrete Fourier Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On the number of multiplications necessary to compute certain functions

This page was built for publication: On the number of active *-operations needed to compute the discrete Fourier transform