Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors
DOI10.13001/1081-3810.3207zbMath1341.65055arXiv1503.04106OpenAlexW2962824909MaRDI QIDQ2813064
Publication date: 14 June 2016
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.04106
error boundsimage reconstructionstable algorithmsdiscrete cosine transformrecursive algorithmssignal flow graphsarithmetic costradix-2 algorithmssparse and orthogonal factors
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast and numerically stable algorithms for discrete cosine transforms
- Fast and Stable Algorithms for Discrete Sine Transformations having Orthogonal Factors
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- A Fast Computational Algorithm for the Discrete Sine Transform
- A Sinusoidal Family of Unitary Transforms
- A Fast Karhunen-Loeve Transform for a Class of Random Processes
- A Fast Computational Algorithm for the Discrete Cosine Transform
- The Discrete Cosine Transform
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
- Discrete Cosine Transform
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- Jointly Optimized Spatial Prediction and Block Transform for Video and Image Coding