Concurrent computation of two-dimensional discrete cosine transform

In this paper, a novel VLSI algorithm for the computation of a two-dimensional discrete cosine transform is proposed. The 2D-DCT equation can be expressed by the sum of high order cosine functions, and the algorithm can be realized by combining a highly efficient first order recursive structure with some simplified matrix multiplications, which results in highly regular hardware architecture and simple routing. The algorithm has temporal and spatial locality of connection and can be segmentized for pipeline operations, so the computation time is greatly reduced. Owing to the simplicity in hardware structure, it is especially good for VLSI implementation.