Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
From MaRDI portal
Publication:937227
DOI10.1007/s00200-008-0077-xzbMath1151.65104OpenAlexW1994729197MaRDI QIDQ937227
Markus Püschel, Martin Roetteler
Publication date: 20 August 2008
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-008-0077-x
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (2)
Multidimensional wave field signal theory: transfer function relationships ⋮ Parametric multi-wavelets on a hexagonal sampling lattice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetry-based matrix factorization
- Fast Fourier analysis for abelian group extensions
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Fast generalized Fourier transforms
- Double coset decompositions and computational harmonic analysis on groups
- Decomposing monomial representations of solvable groups.
- Fast algorithms for discrete polynomial transforms
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
- Discrete Cosine Transform
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- Automatic generation of fast discrete signal transforms
- Efficient algorithms for computing the 2-D hexagonal Fourier transforms
This page was built for publication: Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
