Recursive calculation of discrete cosine transform for low resolution signal processing
From MaRDI portal
Publication:492722
DOI10.1134/S1064562415020167zbMath1321.65198OpenAlexW2268912726MaRDI QIDQ492722
A. V. Vokhmintcev, V. I. Kober, A. V. Mel'nikov
Publication date: 21 August 2015
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562415020167
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
- A Sinusoidal Family of Unitary Transforms
- Recursive formulation of short-time discrete trigonometric transforms
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- Fast Algorithms for the Computation of Sliding Discrete Sinusoidal Transforms
This page was built for publication: Recursive calculation of discrete cosine transform for low resolution signal processing