Abelian semi-simple algebras and algorithms for the discrete Fourier transform
From MaRDI portal
Publication:1060551
DOI10.1016/0196-8858(84)90003-4zbMath0568.65095OpenAlexW2092378566MaRDI QIDQ1060551
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)90003-4
Signal detection and filtering (aspects of stochastic processes) (60G35) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
On algebras related to the discrete cosine transform ⋮ Symmetry-based matrix factorization ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ Multiplicative characters and the discrete Fourier transform ⋮ The multiplicative complexity of the discrete Fourier transform ⋮ Decomposing monomial representations of solvable groups.
Cites Work
- The multiplicative complexity of the discrete Fourier transform
- Fast computation of discrete Fourier transforms using polynomial transforms
- Is computing with the finite Fourier transform pure or applied mathematics?
- On Computing the Discrete Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Unnamed Item
