2-D discrete cosine transforms on a fine grain array processor

The 2-D DCT has been an industry standard in image data compression. Since its first introduction, a number of fast algorithms and technique have been introduced. Most of them were implemented using specialized VLSI chips. In this paper we present an efficient systolic 2-D DCT algorithm on a 2-D mesh fine-grained array processor. Our algorithm reads non-skewed input subimages and generates the output in non-skewed form with only a small amount of extra processors. It uses the minimum number of multiplications by employing modified small n algorithms. Our implementation of the 2-D DCT on the Micro Grained Array Processor (MGAP), which is a fine-grained and mesh-connected array processor being developed at the Penn State University, exploits massive parallelism. As a result the 2-D DCT of size 8/spl times/8 and 16/spl times/16 pixels for 256/spl times/256 pixel images can be computed at real time processing rates.

[1]  Mary Jane Irwin,et al.  The Arithmetic Cube , 1987, IEEE Transactions on Computers.

[2]  Mary Jane Irwin,et al.  A micro-grained VLSI signal processor , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

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

[5]  M. Liou,et al.  A concurrent architecture for VLSI implementation of discrete cosine transform , 1987, IEEE Transactions on Circuits and Systems.

[6]  N. Ahmed,et al.  FAST TRANSFORMS, algorithms, analysis, applications , 1983, Proceedings of the IEEE.

[7]  Ronald N. Bracewell The Hartley transform , 1986 .

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

[9]  Henrique S. Malvar Fast computation of discrete cosine transform through fast Hartley transform , 1986 .

[10]  Charles M. Rader,et al.  Fast transforms: Algorithms, analyses, applications , 1984 .

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

[12]  Robert Michael Owens,et al.  A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform , 1986, IEEE Trans. Acoust. Speech Signal Process..

[13]  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.