An Efficient Architecture for the in Place Fast Cosine Transform

. The two-dimensional discrete cosine transform (2D-DCT) is at the core of image encoding and compression applications. We present a new architecture for the 2D-DCT which is based on rowcolumn decomposition. An efficient architecture to compute the one-dimensional fast direct (1D-DCT) and inverse cosine (1D-IDCT) transforms, which is based in reordering the butterflies after their computation, is also discussed. The architectures designed exploit locality, allowing pipelining between stages and saving memory (in place). The result is an efficient architecture for high speed computation of the (1D,2D)-DCT that significantly reduces the area required for VLSI implementation. Keywords: Discrete Cosine Transform, bit reversal and shuffle permutations, constant geometry architecture. 1. Introduction The two-dimensional Discrete Cosine Transform (2D-DCT) is considered the most efficient technique in image encoding and compression, being used as a standard in many applications [1][2][3]. Se..

An Efficient Architecture For The In Place Fast Cosine Transform

: The cosine transform (DCT) is in the core of image encoding and compression applications. We present a new architecture to compute efficiently the fast direct and inverse cosine transform. Reordering the butterflies after their computation the designed architecture exploits locality, allowing pipelining between stages and saving memory (in place). The result is an efficient architecture for high speed computation of the DCT that reduces significantly the area required to VLSI implementation. Keywords: Discrete Cosine Transform, bit reversal and shuffle permutations, constant geometry architecture. I - INTRODUCTION The two-dimensional Discrete Cosine Transform is considered the most efficient technique in image encoding and compression, being used as a standard in many applications [1][2][3]. Several implementations based on row-column decomposition can be found in the literature. With this scheme, the computationally intensive calculation of an NxN point 2D DCT is transformed into th..