Share Email Print

Proceedings Paper

Computations of the symmetric cosine transform using Forsythe and Clenshaw's recurrence fomulae
Author(s): Maurice F. Aburdene; Hoang M. Le; John E. Dorband
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 14 March 2005
PDF: 10 pages
Proc. SPIE 5685, Image and Video Communications and Processing 2005, (14 March 2005); doi: 10.1117/12.587954
Show Author Affiliations
Maurice F. Aburdene, Bucknell Univ. (United States)
Hoang M. Le, Bucknell Univ. (United States)
John E. Dorband, NASA Goddard Space Flight Ctr. (United States)

Published in SPIE Proceedings Vol. 5685:
Image and Video Communications and Processing 2005
Amir Said; John G. Apostolopoulos, Editor(s)

© SPIE. Terms of Use
Back to Top