A fast 4*4 DCT algorithm for the recursive 2-D DCT
From MaRDI portal
Publication:4031485
DOI10.1109/78.157217zbMath0825.94077OpenAlexW2047868538MaRDI QIDQ4031485
Publication date: 1 April 1993
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/78.157217
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods in Fourier analysis (65T99)
Related Items (4)
Calculation scheme based on a weighted primitive: application to image processing transforms ⋮ A fast algorithm for the \(n\)-D discrete cosine transform ⋮ Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding ⋮ Concurrent computation of two-dimensional discrete cosine transform
This page was built for publication: A fast 4*4 DCT algorithm for the recursive 2-D DCT