A two-dimensional fast cosine transform

DOI10.1109/TASSP.1985.1164737zbMATH Open0621.65036OpenAlexW2141383680MaRDI QIDQ3757264FDOQ3757264

Munsi Alaul Haque

Publication date: 1985

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tassp.1985.1164737

zbMATH Keywords

reduced dimensionfast cosine transform algorithmdecomposition of data sequencesinverse fast cosine transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited In (8)

• Title not available (Why is that?)
• A refined fast 2-D discrete cosine transform algorithm
• On the regular structure for the fast 2-D DCT algorithm
• Two new fast cosine transform (FCT) algorithms based on product system
• A new two-dimensional fast cosine transform algorithm
• One- and two-dimensional constant geometry fast cosine transform algorithms and architectures
• Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
• Fixed-point round-off error analysis for the discrete cosine transform

   Recommendations

• A new two-dimensional fast cosine transform algorithm 👍 👎
• Fast algorithms for the discrete cosine transform 👍 👎
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2) 👍 👎
• Title not available (Why is that?) 👍 👎
• The vector-radix fast cosine transform: Pruning and complexity analysis 👍 👎

This page was built for publication: A two-dimensional fast cosine transform

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