Fast algorithm for 2-D discrete cosine transform

In this paper, an innovative fast algorithm and its corresponding hardware structure are developed for the 2(M) X 2(M) type Discrete cosine transform (DCT). The fast algorithm, derived from the definition of 2-D DCT/IDCT, partitions the output data set into subsets each having the same multiplicands that we call partial sum and transforms the output data into the mul-add format of the partial sums and cosine coefficients. At the end of the paper, the proposed algorithm's hardware architecture for VLSI implementation is presented. The synthesis result shows that the algorithm is efficient and reliable.