Concurrent computation of two-dimensional discrete cosine transform
From MaRDI portal
Publication:2563551
DOI10.1007/BF01188984zbMath0860.68060OpenAlexW2034290784MaRDI QIDQ2563551
Lap-Pui Chau, Yuk-Hee Chan, Wan-Chi Siu
Publication date: 8 April 1997
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01188984
Cites Work
- An Algorithm for the Evaluation of Finite Trigonometric Series
- Interpolation theorem for the number of generalized end-vertices of spanning trees
- A fast cosine transform in one and two dimensions
- A new algorithm to compute the discrete cosine Transform
- A fast 4*4 DCT algorithm for the recursive 2-D DCT
- Modular Realizations of the DFT From the Goertzel DFT Modules (of Smaller Dimension)
- Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms
- On the regular structure for the fast 2-D DCT algorithm
- A VLSI architecture for the real time computation of discrete trigonometric transforms
- Discrete Cosine Transform
This page was built for publication: Concurrent computation of two-dimensional discrete cosine transform