DocumentCode :
898000
Title :
Computation of discrete cosine transform using Clenshaw´s recurrence formula
Author :
Aburdene, Maurice F. ; Zheng, Jianqing ; Kozick, Richard J.
Author_Institution :
Dept. of Electr. Eng., Bucknell Univ., Lewisburg, PA, USA
Volume :
2
Issue :
8
fYear :
1995
Firstpage :
155
Lastpage :
156
Abstract :
Clenshaw´s recurrence formula is used to derive recursive algorithms for the discrete cosine transform (DCT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented requires one fewer delay element per coefficient and one fewer multiply operation per coefficient compared with two other proposed methods. Clenshaw´s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The recursive algorithms apply to arbitrary length algorithms and are appropriate for VLSI implementation.<>
Keywords :
delays; discrete cosine transforms; inverse problems; recursive functions; signal processing; Clenshaw´s recurrence formula; DCT; IDCT; VLSI implementation; arbitrary length algorithms; delay element; discrete cosine transform; inverse discrete cosine transform; multiply operation; recursive algorithms; Chebyshev approximation; Delay; Discrete cosine transforms; Equations; Image processing; Polynomials; Signal processing algorithms; Very large scale integration;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/97.404131
Filename :
404131
Link To Document :
بازگشت