Abstract
The two-dimensional discrete cosine transform (2-D DCT) has been widely recognized as the most effective technique in image data compression. In this paper, we propose a new algorithm to compute the 2-D DCT from a frame-recursive point of view. Based on this approach, a real-time parallel lattice structure for the 2-D DCT is developed. The system is fully-pipelined with throughput rate N clock cycles for an N × N successive input data frame. This is the fastest pipelined structure known so far. Moreover, the 2-D DCT architecture is modular, regular, and requires only two 1-D DCT blocks which can be extended directly from the 1-D DCT array. We also propose a parallel 2-D DCT architecture and a new scanning pattern for the HDTV system to achieve higher performance.