Improvement of the discrete cosine transform calculation by means of a recursive method

DOI10.1016/j.mcm.2009.05.004zbMath1185.94019OpenAlexW1968206295MaRDI QIDQ969952

María Teresa Signes, Juan Manuel García, Higinio Mora-Mora

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.05.004

zbMATH Keywords

JPEGdiscrete cosine transformfunction calculationrecursive operation

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Uses Software

• FFTW

Cites Work

• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• Calculation scheme based on a weighted primitive: application to image processing transforms
• Fast Fourier transforms: A tutorial review and a state of the art
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• Fast and numerically stable algorithms for discrete cosine transforms
• Architecture-oriented regular algorithms for discrete sine and cosine transforms
• Constant geometry algorithm for discrete cosine transform
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• On the multiplicative complexity of discrete cosine transforms
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Two new algorithms based on product system for discrete cosine transform