Automatic generation of fast discrete signal transforms

DOI10.1109/78.942628zbMath1369.65183OpenAlexW2121245437MaRDI QIDQ5353542

Sebastian Egner, Markus Püschel

Publication date: 8 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0bac89acdd61d0886951b9d0ac8f0b40fd901330

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

Minimally disturbing Heisenberg–Weyl symmetric measurements using hard-core collisions of Schrödinger particles ⋮ Symmetry-based matrix factorization ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ Decomposing monomial representations of solvable groups.

This page was built for publication: Automatic generation of fast discrete signal transforms