Computation of discrete cosine transform using Clenshaw's recurence formula

Authors

Maurice F. Aburdene, Bucknell UniversityFollow
Zheng Jianqing
R. J. KozickFollow

Publication Date

8-1995

Description

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.

Journal

Signal Processing Letters, IEEE

Volume

2

Issue

8

First Page

155

Last Page

156

Department

Electrical Engineering

Link to Published Version

http://dx.doi.org/10.1109/97.404131

Recommended Citation

Aburdene, Maurice F.; Jianqing, Zheng; and Kozick, R. J.. "Computation of discrete cosine transform using Clenshaw's recurence formula." Signal Processing Letters, IEEE (1995) : 155-156.