An efficient algorithm for the 2-D discrete cosine transform

DOI10.1016/S0165-1684(96)00132-6MaRDI QIDQ673366zbMATH OpenOpenAlexFDO

Authors Gau-Shin Liu, Pei-Zong Lee

Publication date 28 February 1997

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-1684(96)00132-6

zbMATH Keywords

2-D discrete cosine transformRecursive algorithmSignal-flow graph

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(11)

• Fast recursive algorithms for 2-D discrete cosine transform.
• Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
• Concurrent computation of two-dimensional discrete cosine transform
• A refined fast 2-D discrete cosine transform algorithm
• The advanced OCA for 2-D discrete periodized wavelet transformation
• A generalized output pruning algorithm for matrix-vector multiplication and its application to compute discrete cosine transform
• On the computation of two-dimensional DCT
• A new two-dimensional fast cosine transform algorithm
• On the regular structure for the fast 2-D DCT algorithm
• Efficient index mapping for computing discrete cosine transform
• Two-dimensional linear convolution in the discrete trigonometric transform domain

This page was built for publication: An efficient algorithm for the 2-D discrete cosine transform

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