Recursive calculation of discrete cosine transform for low resolution signal processing

DOI10.1134/S1064562415020167MaRDI QIDQ492722zbMATH OpenOpenAlexFDO

Authors V. I. Kober, A. V. Vokhmintcev, 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

zbMATH Keywords

discrete cosine transformlow resolution signal processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites work

• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• A Sinusoidal Family of Unitary Transforms
• Fast Algorithms for the Computation of Sliding Discrete Sinusoidal Transforms
• scientific article; zbMATH DE number 43706 (Why is no real title available?)
• scientific article; zbMATH DE number 50749 (Why is no real title available?)
• scientific article; zbMATH DE number 1534309 (Why is no real title available?)
• Recursive formulation of short-time discrete trigonometric transforms
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

This page was built for publication: Recursive calculation of discrete cosine transform for low resolution signal processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492722)