Fast Discrete Cosine Transform via Computation of Moments

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.

[1]  Weiping Li,et al.  A new algorithm to compute the DCT and its inverse , 1991, IEEE Trans. Signal Process..

[2]  J. Makhoul.  A fast cosine transform in one and two dimensions , 1980 .

[3]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[4]  Moon Ho Lee.  On computing 2-D systolic algorithm for discrete cosine transform , 1990 .

[5]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[6]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[7]  Chaitali Chakrabarti,et al.  Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition , 1990, IEEE Trans. Computers.

[8]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[9]  F. H. Y. Chan,et al.  An all adder systolic structure for fast computation of moments , 1996, J. VLSI Signal Process..

[10]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[11]  Ja-Ling Wu,et al.  Novel concurrent architecture to implement the discrete cosine transform based on index partitions , 1990 .

[12]  Zhenyang Wu,et al.  An efficient CORDIC array structure for the implementation of discrete cosine transform , 1995, IEEE Transactions on Signal Processing.

[13]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[14]  K. L. Ho,et al.  A new two-dimensional fast cosine transform algorithm , 1991, IEEE Trans. Signal Process..

[15]  Paul J. Zsombor-Murray,et al.  Fast algorithm for the computation of moment invariants , 1987, Pattern Recognit..

[16]  Chingwo Ma,et al.  A Fast Recursive Two Dimensional Cosine Transform , 1989, Other Conferences.

[17]  Mehdi Hatamian,et al.  A real-time two-dimensional moment generating algorithm and its single chip implementation , 1986, IEEE Trans. Acoust. Speech Signal Process..

[18]  Richard J. Prokop,et al.  A survey of moment-based techniques for unoccluded object representation and recognition , 1992, CVGIP Graph. Model. Image Process..

[19]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[20]  Nam Ik Cho,et al.  A fast 4×4 DCT algorithm for the recursive 2-D DCT , 1992, IEEE Trans. Signal Process..

[21]  MUNSI ALAUL HAQUE,et al.  A two-dimensional fast cosine transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[22]  Keping Chen.  Efficient parallel algorithms for the computation of two-dimensional image moments , 1990, Pattern Recognit..

[23]  Jun Shen,et al.  Pascal triangle transform approach to the calculation of 3D moments , 1992, CVGIP Graph. Model. Image Process..

[24]  Ming-Chang Wu,et al.  A unified systolic array for discrete cosine and sine transforms , 1991, IEEE Trans. Signal Process..

[25]  K. Sam Shanmugam.  Comments on "Discrete Cosine Transform" , 1975, IEEE Trans. Computers.