Partial Sum Based Algorithm for the Discrete Cosine Transform

In this paper, a fast algorithm and its corresponding hardware structure are developed for the 2^Mtimes2^M type discrete cosine transform. The transform output is transformed into a mul-add format by the definition of the 2-D DCT/IDCT. The output data set is partitioned into several subsets each having the same multiplicands that we call partial sum. By computing partial sum, the addition and multiplication operation times can be greatly reduced. In final, its corresponding hardware architecture is presented for VLSI implementation. The synthesis result shows that the algorithm is efficient and reliable