Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
From MaRDI portal
Publication:4568614
DOI10.1109/TSP.2007.907919zbMath1390.94059MaRDI QIDQ4568614
Markus Püschel, José M. F. Moura
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Related Items (7)
On the Discrete Cosine Transform of Weakly Stationary Signals ⋮ Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms ⋮ Signal Processing on Weighted Line Graphs ⋮ Multidimensional wave field signal theory: transfer function relationships ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ Signal flow graph approach to efficient and forward stable DST algorithms
This page was built for publication: Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
