Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
From MaRDI portal
Publication:4568614
Recommendations
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
- Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
- An algebraic approach to signal processing: Algorithms and applications
- Some algebraic aspects of signal processing
- Discrete-time signal processing. An algebraic approach
- scientific article; zbMATH DE number 33428
- scientific article; zbMATH DE number 194254
- scientific article; zbMATH DE number 3917702
- Algebraic Signal Processing Theory: Foundation and 1-D Time
Cited in
(9)- The AICE-CRT and digital signal processing algorithms: The complex case
- Multidimensional wave field signal theory: transfer function relationships
- Signal flow graph approach to efficient and forward stable DST algorithms
- Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
- On the Discrete Cosine Transform of Weakly Stationary Signals
- scientific article; zbMATH DE number 33428 (Why is no real title available?)
- Lowest complexity self-recursive radix-2 DCT II/III algorithms
- Signal processing on weighted line graphs
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
This page was built for publication: Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568614)