Translator Disclaimer
Paper
14 March 2005 Computations of the symmetric cosine transform using Forsythe and Clenshaw's recurrence formulae
Author Affiliations +
Proceedings Volume 5685, Image and Video Communications and Processing 2005; (2005) https://doi.org/10.1117/12.587954
Event: Electronic Imaging 2005, 2005, San Jose, California, United States
Abstract
The discrete cosine transform (DCT) is commonly used in signal processing, image processing, communication systems and control systems. We use two methods based on the algorithms of Clenshaw and Forsyth to compute the recursive DCT in parallel. The symmetrical discrete cosine transform (SCT) is computed first and then it can be used as an intermediate tool to compute other forms of the DCT. The advantage of the SCT is that both the forward SCT and its inverse can be computed by the same method and hardware implementation. Although Clenshaw’s algorithm is the more efficient in computational complexity, it is not necessarily the more accurate one. The computational accuracy of these algorithms is discussed. In addition, the front-to-back forms of Clenshaw and Forsyth’s algorithms are implemented in aCe C, a parallel programming language.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Maurice F. Aburdene, Hoang M. Le, and John E. Dorband "Computations of the symmetric cosine transform using Forsythe and Clenshaw's recurrence formulae", Proc. SPIE 5685, Image and Video Communications and Processing 2005, (14 March 2005); https://doi.org/10.1117/12.587954
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top