Fast Discrete Cosine Transform via Computation of Moments |
| |
Authors: | J.G. Liu H.F. Li F.H.Y. Chan F.K. Lam |
| |
Affiliation: | (1) Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong;(2) Department of Computer Science, University of Concordia, 1455 De Maisonneuve West, Montreal, Quebec, H3G 1M8, Canada |
| |
Abstract: | Discrete cosine transform (DCT) is widely used in signal processing. This paper presents a novel approach to perform DCT. DCT is expressed in terms of discrete moments via triangle function transforms and later Taylor series expansion. From this, a fast systolic array for computing moments is converted to compute DCT with only a few multiplications and without any cosine evaluations. The systolic array has advantages of pipelinability, regularity, modularity, local connectivity and scalability, thus making it to be very suitable for VLSI implementation. We provide an estimate of the realizability of our array in a 0.5 m CMOS technology and comparisons with other methods. The execution time of the systolic array is only O(N log2N/log2 log2N) in computing 1D N-point DCT if N is sufficiently large. The approach is also applicable to multiple dimensional DCT and DCT inverses. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|