A two-dimensional fast cosine transform
From MaRDI portal
Publication:3757264
DOI10.1109/TASSP.1985.1164737zbMATH Open0621.65036OpenAlexW2141383680MaRDI QIDQ3757264FDOQ3757264
Authors: 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
Recommendations
reduced dimensionfast cosine transform algorithmdecomposition of data sequencesinverse fast cosine transform
Cited In (9)
- 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
- Title not available (Why is that?)
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)