Name
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.<> |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/97.404131 | Signal Processing Letters, IEEE |
Keywords | DocType | Volume |
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 | Journal | 2 |
Issue | ISSN | Citations |
8 | 1070-9908 | 22 |
PageRank | References | Authors |
2.42 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aburdene, M.F. | 1 | 36 | 5.50 |
| Jianqing Zheng | 2 | 22 | 2.76 |
| Richard J. Kozick | 3 | 144 | 21.52 |