A NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM
二维离散余弦变换的一种新的快速算法

A new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N X N DCT, where N - 2", can be computed using only N 1-D DCT's and additions, instead of using 2N 1-D DCT's, as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.