The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
fast algorithmsymmetryFFTChebyshev polynomialgroup representationdiscrete cosine transform (DCT)discrete Fourier transform (DFT)discrete sine transform (DST)polynomial transformalgebra representationdiscrete trigonometric transform (DTT)
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical methods for discrete and fast Fourier transforms (65T50) Applications of hypergeometric functions (33C90) Connections of hypergeometric functions with groups and algebras, and related topics (33C80)
- On algebras related to the discrete cosine transform
- The Cooley-Tukey FFT and group theory.
- Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction
- scientific article; zbMATH DE number 4197369
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- Fast and numerically stable algorithms for discrete cosine transforms
- Signal processing on weighted line graphs
- Some classes of tetradiagonal determinants via certain polynomial families
- Fast algorithms using orthogonal polynomials
- Harmonic analysis of finite lamplighter random walks
- Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction
- Signal flow graph approach to efficient and forward stable DST algorithms
- Spectral analysis of finite Markov chains with spherical symmetries
- Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
- The Arithmetic Cosine Transform: Exact and Approximate Algorithms
- Factorizations and representations of the backward second-order linear recurrences
- Lowest complexity self-recursive radix-2 DCT II/III algorithms
- On a constant-diagonals matrix
- Improvement of the discrete cosine transform calculation by means of a recursive method
- A Filon-type asymptotic approach to solving highly oscillatory second-order initial value problems
- A sixth-order quasi-compact difference scheme for multidimensional Poisson equations without derivatives of source term
- Radon transforms and lamplighter random walks
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
- Symmetry-based matrix factorization
This page was built for publication: The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429686)
