A refined fast 2-D discrete cosine transform algorithm

DOI10.1109/78.747801MaRDI QIDQ2732816zbMATH OpenOpenAlexFDO

Authors Yuh-Ming Huang, Ja-Ling Wu

Publication date 7 February 2002

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/489881adc9c5fa04ad990e30db0861e0139c4ab7

zbMATH Keywords

digital signal processingfast two-dimensional discrete cosine transformindex permutation

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
• An efficient algorithm for the 2-D discrete cosine transform
• On the computation of two-dimensional DCT
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)
• A two-dimensional fast cosine transform

Cited in

(10)

• Fast unified computation of the multi-dimensional discrete sinusoidal transforms
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
• A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding
• On the computation of two-dimensional DCT
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)
• Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
• 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
• An efficient algorithm for the 2-D discrete cosine transform

This page was built for publication: A refined fast 2-D discrete cosine transform algorithm

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