The multiplicative complexity of the discrete Fourier transform

DOI10.1016/0196-8858(84)90005-8zbMath0568.65096OpenAlexW2060231433MaRDI QIDQ1060552

Ephraim Feig, Louis Auslander, Shmuel Winograd

Publication date: 1984

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(84)90005-8

zbMATH Keywords

discrete Fourier transformmultiplicative complexityminimal algorithms

Mathematics Subject Classification ID

Related Items (4)

On algebras related to the discrete cosine transform ⋮ Modified FFTs for Fused Multiply-Add Architectures ⋮ The multiplicative complexity of discrete cosine transforms ⋮ Abelian semi-simple algebras and algorithms for the discrete Fourier transform

Cites Work

• The multiplicative complexity of certain semilinear systems defined by polynomials
• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• On the multiplicative complexity of the discrete Fourier transform

This page was built for publication: The multiplicative complexity of the discrete Fourier transform