Fast recursive algorithms for 2-D discrete cosine transform.

DOI10.1016/S0165-1684(00)00102-XMaRDI QIDQ1575779zbMATH OpenOpenAlexWikidataFDO

Authors N. Delaunay

Publication date 21 August 2000

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-1684(00)00102-x

zbMATH Keywords

algorithmdiscrete cosine transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• On the computation of two-dimensional DCT
• An efficient algorithm for the 2-D discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• Fast algorithms for the discrete cosine transform

Cited in

(12)

• A unified algorithm for subband-based discrete cosine transform
• Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
• Concurrent computation of two-dimensional discrete cosine transform
• On the computation of two-dimensional DCT
• Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
• A new two-dimensional fast cosine transform algorithm
• New fast recursive algorithms for the computation of discrete cosine and sine transforms
• scientific article; zbMATH DE number 1833436 (Why is no real title available?)
• Two-dimensional linear convolution in the discrete trigonometric transform domain
• A tutorial overview on the properties of the discrete cosine transform for encoded image and video processing
• An efficient algorithm for the 2-D discrete cosine transform
• Improvement of the discrete cosine transform calculation by means of a recursive method

This page was built for publication: Fast recursive algorithms for 2-D discrete cosine transform.

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